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

Research

Links

Text available via DOI:

View graph of relations

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

Research output: Contribution to Journal/Magazine › Journal article

Published

Standard

An improvement of Hind's upper bound on the total chromatic number. / Chetwynd, Amanda G.; Haggkvist, Roland A.
In: Combinatorics, Probability and Computing, Vol. 5, No. 2, 06.1996, p. 99-104.

Research output: Contribution to Journal/Magazine › Journal article

Harvard

Chetwynd, AG & Haggkvist, RA 1996, 'An improvement of Hind's upper bound on the total chromatic number.', Combinatorics, Probability and Computing, vol. 5, no. 2, pp. 99-104. https://doi.org/10.1017/S0963548300001899

APA

Chetwynd, A. G., & Haggkvist, R. A. (1996). An improvement of Hind's upper bound on the total chromatic number. Combinatorics, Probability and Computing, 5(2), 99-104. https://doi.org/10.1017/S0963548300001899

Vancouver

Chetwynd AG, Haggkvist RA. An improvement of Hind's upper bound on the total chromatic number. Combinatorics, Probability and Computing. 1996 Jun;5(2):99-104. doi: 10.1017/S0963548300001899

Author

Chetwynd, Amanda G. ; Haggkvist, Roland A. / An improvement of Hind's upper bound on the total chromatic number. In: Combinatorics, Probability and Computing. 1996 ; Vol. 5, No. 2. pp. 99-104.

Bibtex

@article{810ddd304f7f4047b6bb5488cdbbd4d7,
title = "An improvement of Hind's upper bound on the total chromatic number.",
abstract = "We show that the total chromatic number of a simple k-chromatic graph exceeds the chromatic index by at most 18k ⅓ log ½ 3k.",
author = "Chetwynd, {Amanda G.} and Haggkvist, {Roland A.}",
year = "1996",
month = jun,
doi = "10.1017/S0963548300001899",
language = "English",
volume = "5",
pages = "99--104",
journal = "Combinatorics, Probability and Computing",
issn = "0963-5483",
publisher = "Cambridge University Press",
number = "2",

}

RIS

TY - JOUR

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

AU - Chetwynd, Amanda G.

AU - Haggkvist, Roland A.

PY - 1996/6

Y1 - 1996/6

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

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

U2 - 10.1017/S0963548300001899

DO - 10.1017/S0963548300001899

M3 - Journal article

VL - 5

SP - 99

EP - 104

JO - Combinatorics, Probability and Computing

JF - Combinatorics, Probability and Computing

SN - 0963-5483

IS - 2

ER -