Home > Research > Publications & Outputs > Some upper bounds on the list and total chromat...
View graph of relations

Some upper bounds on the list and total chromatic numbers of multigraphs.

Research output: Contribution to Journal/MagazineJournal article

Published

Standard

Some upper bounds on the list and total chromatic numbers of multigraphs. / Haggkvist, Roland A.; Chetwynd, Amanda G.
In: Journal of Graph Theory, Vol. 16, No. 5, 11.1992, p. 503-516.

Research output: Contribution to Journal/MagazineJournal article

Harvard

APA

Vancouver

Haggkvist RA, Chetwynd AG. Some upper bounds on the list and total chromatic numbers of multigraphs. Journal of Graph Theory. 1992 Nov;16(5):503-516. doi: 10.1002/jgt.3190160510

Author

Haggkvist, Roland A. ; Chetwynd, Amanda G. / Some upper bounds on the list and total chromatic numbers of multigraphs. In: Journal of Graph Theory. 1992 ; Vol. 16, No. 5. pp. 503-516.

Bibtex

@article{1923d6c51c9c4404a2f1669a205b9c26,
title = "Some upper bounds on the list and total chromatic numbers of multigraphs.",
abstract = "In this paper we discuss some estimates for upper bounds on a number of chromatic parameters of a multigraph. In particular, we show that the total chromatic number for an n-order multigraph exceeds the chromatic index by the smallest t such that t! > n.",
author = "Haggkvist, {Roland A.} and Chetwynd, {Amanda G.}",
year = "1992",
month = nov,
doi = "10.1002/jgt.3190160510",
language = "English",
volume = "16",
pages = "503--516",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "5",

}

RIS

TY - JOUR

T1 - Some upper bounds on the list and total chromatic numbers of multigraphs.

AU - Haggkvist, Roland A.

AU - Chetwynd, Amanda G.

PY - 1992/11

Y1 - 1992/11

N2 - In this paper we discuss some estimates for upper bounds on a number of chromatic parameters of a multigraph. In particular, we show that the total chromatic number for an n-order multigraph exceeds the chromatic index by the smallest t such that t! > n.

AB - In this paper we discuss some estimates for upper bounds on a number of chromatic parameters of a multigraph. In particular, we show that the total chromatic number for an n-order multigraph exceeds the chromatic index by the smallest t such that t! > n.

U2 - 10.1002/jgt.3190160510

DO - 10.1002/jgt.3190160510

M3 - Journal article

VL - 16

SP - 503

EP - 516

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 5

ER -