|
ON THE COMPLETE CHROMATIC NUMBER OF HALIN GRAPHS
ZHANG ZHONGFU; LIU LINZHONG
Acta Mathematicae Applicatae Sinica
1997, 20 (1):
0-0.
DOI: 10.12387/C1997023
Let G be a planar graph with δ(G)≥3, fo be a face of G. In this paper it is proved that for any Halin graph with △(G)≥6, X (G)=△(G)+1, where △(G), Xo (G) denote the maximum degree and the complete chromatic number of G, respectively.
Related Articles |
Metrics
|
|