Chetwynd, Amanda G. and Hilton, A. J. W. and Zhao, Cheng (1991) On the total chromatic number of graphs of high minimum degree. Journal of the London Mathematical Society, Series (2). pp. 193-202. ISSN 0024-6107
Full text not available from this repository.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.
Item Type:
Journal Article
Journal or Publication Title:
Journal of the London Mathematical Society
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2600/2600
Subjects:
?? general mathematicsmathematics(all)qa mathematics ??
ID Code:
20037
Deposited By:
Deposited On:
25 Nov 2008 14:15
Refereed?:
No
Published?:
Published
Last Modified:
16 Jul 2024 08:18