On the complete chromatic number of Halin graphs |
| |
Authors: | Zhongfu Zhang Linzhong Liu |
| |
Affiliation: | (1) Department of Basic Courses, Lanzhou Railway Institute, 730070 Lanzhou, China |
| |
Abstract: | ![]() LetG be a planar graph with (G) 3,f0 be a face ofG. In this paper it is proved that for any Halin graph with (G) 6,xc(G)= (G)+1, where (G),xc(G) denote the maximum degree and the complete chromatic number ofG, respectively.This research is supported by the National Natural Science Foundation of China.Write. |
| |
Keywords: | Halin graph complete chromatic number |
本文献已被 CNKI SpringerLink 等数据库收录! |
|