Article contents
An Improvement of Hind's Upper Bound on the Total Chromatic Number
Published online by Cambridge University Press: 12 September 2008
Abstract
We show that the total chromatic number of a simple k-chromatic graph exceeds the chromatic index by at most 18k ⅓ log ½ 3k.
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1996
References
- 2
- Cited by