Home > Research > Publications & Outputs > On the total chromatic number of graphs of high...

Research

Links

Text available via DOI:

View graph of relations

On the total chromatic number of graphs of high minimum degree.

Research output: Contribution to Journal/Magazine › Journal article

Published
Close
More...
<mark>Journal publication date</mark>10/1991
<mark>Journal</mark>Journal of the London Mathematical Society
Issue number2
VolumeSeries
Number of pages10
Pages (from-to)193-202
Publication StatusPublished
<mark>Original language</mark>English

Abstract

If G is a simple graph with minimum degree (G) satisfying (G) f(|V(G|+1) the total chromatic number conjecture holds; moreover if (G) |V(G| then T(G) (G)+3. Also if G has odd order and is regular with d{G) 7|(G)| then a necessary and sufficient condition for T(G) = (G)+1 is given.