𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Zhongfu Zhang; Linzhong Liu; Jianfang Wang; Hongxiang Li

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
210 KB
Volume
11
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Total chromatic number of planar graphs
Total chromatic number of planar graphs with maximum degree ten
✍ 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 graphs hav
The total chromatic number of graphs having large maximum degree
✍ A.J.W. Hilton; H.R. Hind πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 935 KB

Hilton, A.J.W. and H.R. Hind, The total chromatic number ofgraphs having large maximum degree, Discrete Mathematics 117 (1993) 127-140. The total colouring conjecture is shown to be correct for those graphs G having d(G)>21 V(G)I.

A note on the line-distinguishing chroma
A note on the line-distinguishing chromatic number and the chromatic index of a graph
✍ N. Zagaglia Salvi πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 126 KB πŸ‘ 1 views

## Abstract Let Ξ»(__G__) be the line‐distinguishing chromatic number and __x__β€²(__G__) the chromatic index of a graph __G__. We prove the relation Ξ»(__G__) β‰₯ __x__β€²(__G__), conjectured by Harary and Plantholt. Β© 1993 John Wiley & Sons, Inc.