๐”– Bobbio Scriptorium
โœฆ   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

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.

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

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