On the complete chromatic number of Halin graphs
β Scribed by Zhongfu Zhang; Linzhong Liu
- Publisher
- Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
- Year
- 1997
- Tongue
- English
- Weight
- 300 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0168-9673
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A complete cubic Halin graph is a cubic Halin graph whose characteristic tree is a complete cubic tree, in which all leaves are at the same distance from the root vertex. In this work, we determine the strong chromatic index of the complete cubic Halin graph.
In this paper, we shall first prove that for a Halin graph G, 4 Β°xT (G) Β°6, where x T (G) is the vertex-face total chromatic number of G. Second, we shall establish a sufficient condition for a Halin graph to have a vertex-face total chromatic number of 6. Finally, we shall give a necessary and suff
In this paper, we prove that XT(G) = 5 for any Halin graph G with A(G) = 4, where A(G) and XT(G) denote the maximal degree and the total chromatic number of G, respectively.