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.
Official URL: https://doi.org/10.1017/S0963548300001899
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/researchoutput/libraryofcongress/qa
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:
21 Sep 2023 00:39