Home > Research > Publications & Outputs > An improvement of Hind's upper bound on the tot...
View graph of relations

An improvement of Hind's upper bound on the total chromatic number.

Research output: Contribution to Journal/MagazineJournal article

Published
<mark>Journal publication date</mark>06/1996
<mark>Journal</mark>Combinatorics, Probability and Computing
Issue number2
Volume5
Number of pages6
Pages (from-to)99-104
Publication StatusPublished
<mark>Original language</mark>English

Abstract

We show that the total chromatic number of a simple k-chromatic graph exceeds the chromatic index by at most 18k ⅓ log ½ 3k.