Home > Research > Publications & Outputs > Chromatic index critical graphs of order 9.
View graph of relations

Chromatic index critical graphs of order 9.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Chromatic index critical graphs of order 9. / Chetwynd, Amanda G.; Yap, H. P.
In: Discrete Mathematics, Vol. 47, No. 1, 1983, p. 23-33.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Chetwynd, AG & Yap, HP 1983, 'Chromatic index critical graphs of order 9.', Discrete Mathematics, vol. 47, no. 1, pp. 23-33. https://doi.org/10.1016/0012-365X(83)90069-9

APA

Vancouver

Chetwynd AG, Yap HP. Chromatic index critical graphs of order 9. Discrete Mathematics. 1983;47(1):23-33. doi: 10.1016/0012-365X(83)90069-9

Author

Chetwynd, Amanda G. ; Yap, H. P. / Chromatic index critical graphs of order 9. In: Discrete Mathematics. 1983 ; Vol. 47, No. 1. pp. 23-33.

Bibtex

@article{71584a5e74b8412593bbfa2cd00ff923,
title = "Chromatic index critical graphs of order 9.",
abstract = "We prove that a 2-connected graph of order 9 having maximum valency Δ 4 is chromatic index critical if and only if its valency-list is one of the following: 248, 3247 (except one graph), 258, 3457, 4356, 268, 3567, 4267, 45266, 5465, 278, 3677, 4577, 46276, 52676, 56375, 6574, 57385, 6386, 627285, 67484 and 7683. This, together with known results, provide a complete catalogue of all chromatic index critical graphs of order 10.",
author = "Chetwynd, {Amanda G.} and Yap, {H. P.}",
year = "1983",
doi = "10.1016/0012-365X(83)90069-9",
language = "English",
volume = "47",
pages = "23--33",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1",

}

RIS

TY - JOUR

T1 - Chromatic index critical graphs of order 9.

AU - Chetwynd, Amanda G.

AU - Yap, H. P.

PY - 1983

Y1 - 1983

N2 - We prove that a 2-connected graph of order 9 having maximum valency Δ 4 is chromatic index critical if and only if its valency-list is one of the following: 248, 3247 (except one graph), 258, 3457, 4356, 268, 3567, 4267, 45266, 5465, 278, 3677, 4577, 46276, 52676, 56375, 6574, 57385, 6386, 627285, 67484 and 7683. This, together with known results, provide a complete catalogue of all chromatic index critical graphs of order 10.

AB - We prove that a 2-connected graph of order 9 having maximum valency Δ 4 is chromatic index critical if and only if its valency-list is one of the following: 248, 3247 (except one graph), 258, 3457, 4356, 268, 3567, 4267, 45266, 5465, 278, 3677, 4577, 46276, 52676, 56375, 6574, 57385, 6386, 627285, 67484 and 7683. This, together with known results, provide a complete catalogue of all chromatic index critical graphs of order 10.

U2 - 10.1016/0012-365X(83)90069-9

DO - 10.1016/0012-365X(83)90069-9

M3 - Journal article

VL - 47

SP - 23

EP - 33

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1

ER -