THE TOTAL CHROMATIC NUMBER OF GRAPHS HAVING LARGE MAXIMUM DEGREE

Authors
HILTON AJW HIND HR
Citation
Ajw. Hilton et Hr. Hind, THE TOTAL CHROMATIC NUMBER OF GRAPHS HAVING LARGE MAXIMUM DEGREE, Discrete mathematics, 117(1-3), 1993, pp. 127-140
Citations number
21
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
Discrete mathematics → ACNP
ISSN journal
0012365X
Volume
117
Issue
1-3
Year of publication
1993
Pages
127 - 140
Database
ISI
SICI code
0012-365X(1993)117:1-3<127:TTCNOG>2.0.ZU;2-7
Abstract
The total colouring conjecture is shown to be correct for those graphs G having DELTA(G) greater-than-or-equal-to 3/4\V(G)\.