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

Chetwynd, Amanda G. and Haggkvist, Roland A. (1996) An improvement of Hind's upper bound on the total chromatic number. Combinatorics, Probability and Computing, 5 (2). pp. 99-104. ISSN 0963-5483

Full text not available from this repository.

Abstract

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

Item Type:
Journal Article
Journal or Publication Title:
Combinatorics, Probability and Computing
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1700/1703
Subjects:
?? computational theory and mathematicstheoretical computer scienceapplied mathematicsstatistics and probabilityqa mathematics ??
ID Code:
20770
Deposited By:
Deposited On:
26 Nov 2008 12:16
Refereed?:
No
Published?:
Published
Last Modified:
15 Jul 2024 09:51