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

The Total Chromatic Number of Graphs of High Minimum Degree

โœ Scribed by Chetwynd, A. G.; Hilton, A. J. W.; Cheng, Z.

Book ID
120094780
Publisher
Oxford University Press
Year
1991
Tongue
English
Weight
229 KB
Volume
s2-44
Category
Article
ISSN
0024-6107

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

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.