Home > Research > Publications & Outputs > On the total chromatic number of graphs of high...

Research

Links

Text available via DOI:

View graph of relations

On the total chromatic number of graphs of high minimum degree.

Research output: Contribution to Journal/Magazine › Journal article

Published

Standard

On the total chromatic number of graphs of high minimum degree. / Chetwynd, Amanda G.; Hilton, A. J. W.; Zhao, Cheng.
In: Journal of the London Mathematical Society, Vol. Series, No. 2, 10.1991, p. 193-202.

Research output: Contribution to Journal/Magazine › Journal article

Harvard

Chetwynd, AG, Hilton, AJW & Zhao, C 1991, 'On the total chromatic number of graphs of high minimum degree.', Journal of the London Mathematical Society, vol. Series, no. 2, pp. 193-202. https://doi.org/10.1112/jlms/s2-44.2.193

APA

Chetwynd, A. G., Hilton, A. J. W., & Zhao, C. (1991). On the total chromatic number of graphs of high minimum degree. Journal of the London Mathematical Society, Series(2), 193-202. https://doi.org/10.1112/jlms/s2-44.2.193

Vancouver

Chetwynd AG, Hilton AJW, Zhao C. On the total chromatic number of graphs of high minimum degree. Journal of the London Mathematical Society. 1991 Oct;Series(2):193-202. doi: 10.1112/jlms/s2-44.2.193

Author

Chetwynd, Amanda G. ; Hilton, A. J. W. ; Zhao, Cheng. / On the total chromatic number of graphs of high minimum degree. In: Journal of the London Mathematical Society. 1991 ; Vol. Series, No. 2. pp. 193-202.

Bibtex

@article{db6a98d5dc9041c09a4604548e1d7961,
title = "On the total chromatic number of graphs of high minimum degree.",
abstract = "If G is a simple graph with minimum degree (G) satisfying (G) f(|V(G|+1) the total chromatic number conjecture holds; moreover if (G) |V(G| then T(G) (G)+3. Also if G has odd order and is regular with d{G) 7|(G)| then a necessary and sufficient condition for T(G) = (G)+1 is given.",
author = "Chetwynd, {Amanda G.} and Hilton, {A. J. W.} and Cheng Zhao",
year = "1991",
month = oct,
doi = "10.1112/jlms/s2-44.2.193",
language = "English",
volume = "Series",
pages = "193--202",
journal = "Journal of the London Mathematical Society",
issn = "0024-6107",
publisher = "Oxford University Press",
number = "2",

}

RIS

TY - JOUR

T1 - On the total chromatic number of graphs of high minimum degree.

AU - Chetwynd, Amanda G.

AU - Hilton, A. J. W.

AU - Zhao, Cheng

PY - 1991/10

Y1 - 1991/10

N2 - If G is a simple graph with minimum degree (G) satisfying (G) f(|V(G|+1) the total chromatic number conjecture holds; moreover if (G) |V(G| then T(G) (G)+3. Also if G has odd order and is regular with d{G) 7|(G)| then a necessary and sufficient condition for T(G) = (G)+1 is given.

AB - If G is a simple graph with minimum degree (G) satisfying (G) f(|V(G|+1) the total chromatic number conjecture holds; moreover if (G) |V(G| then T(G) (G)+3. Also if G has odd order and is regular with d{G) 7|(G)| then a necessary and sufficient condition for T(G) = (G)+1 is given.

U2 - 10.1112/jlms/s2-44.2.193

DO - 10.1112/jlms/s2-44.2.193

M3 - Journal article

VL - Series

SP - 193

EP - 202

JO - Journal of the London Mathematical Society

JF - Journal of the London Mathematical Society

SN - 0024-6107

IS - 2

ER -