๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Total chromatic number of graphs of odd order and high degree

โœ Scribed by K.H. Chew

Book ID
108316344
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
87 KB
Volume
205
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Total chromatic number of regular graphs
Total chromatic number of regular graphs of odd order and high degree
โœ K.H. Chew ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 695 KB

The total chromatic number XT(G) of a graph G is the least number of colours needed to colour the edges and vertices of G so that no incident or adjacent elements receive the same colour. This paper shows that if G is odd order and regular of degree d > [(&? -1)/6]1 V(G)/, then a necessary and suffi

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.