✦ LIBER ✦

On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cycles

✍ Scribed by Lan Shen; Yingqian Wang

Publisher: Springer Japan
Year: 2009
Tongue: English
Weight: 168 KB
Volume: 25
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-009-0843-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the total chromatic number of

A note on the total chromatic number of Halin graphs with maximum degree 4

✍ 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.