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.
โฆ LIBER โฆ
The total chromatic number of Pseudo-Halin graphs with lower degree
โ Scribed by Xianyong Meng; Jianhua Guo; Rensuo Li; Tao Chen; Bentang Su
- Book ID
- 108114000
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 447 KB
- Volume
- 309
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A note on the total chromatic number of
โ
Zhongfu Zhang; Linzhong Liu; Jianfang Wang; Hongxiang Li
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 210 KB
The vertex-face total chromatic number o
โ
Lam, Peter C. B.; Zhang, Zhongfu
๐
Article
๐
1997
๐
John Wiley and Sons
๐
English
โ 69 KB
๐ 2 views
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
The total chromatic number of pseudo-out
โ
Wang Weifan; Zhang Kemin
๐
Article
๐
1997
๐
SP Editorial Committee of Applied Mathematics - A
๐
English
โ 404 KB
On the complete chromatic number of Hali
โ
Zhongfu Zhang; Linzhong Liu
๐
Article
๐
1997
๐
Institute of Applied Mathematics, Chinese Academy
๐
English
โ 300 KB
Total chromatic number of planar graphs
โ
Weifan Wang
๐
Article
๐
2006
๐
John Wiley and Sons
๐
English
โ 161 KB
๐ 1 views
## Abstract In this article we prove that the total chromatic number of a planar graph with maximum degree 10 is 11. ยฉ 2006 Wiley Periodicals, Inc. J Graph Theory 54: 91โ102, 2007
The total chromatic number of regular gr
โ
DeZheng Xie; WanNian Yang
๐
Article
๐
2009
๐
SP Science China Press
๐
English
โ 309 KB