Home > Research > Publications & Outputs > Chromatic index of graphs of even order with ma...
View graph of relations

Chromatic index of graphs of even order with many edges.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Chromatic index of graphs of even order with many edges. / Chetwynd, Amanda G.; Hilton, A. J. W.
In: Journal of Graph Theory, Vol. 8, No. 4, 1984, p. 463-470.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Chetwynd, AG & Hilton, AJW 1984, 'Chromatic index of graphs of even order with many edges.', Journal of Graph Theory, vol. 8, no. 4, pp. 463-470. https://doi.org/10.1002/jgt.3190080403

APA

Vancouver

Chetwynd AG, Hilton AJW. Chromatic index of graphs of even order with many edges. Journal of Graph Theory. 1984;8(4):463-470. doi: 10.1002/jgt.3190080403

Author

Chetwynd, Amanda G. ; Hilton, A. J. W. / Chromatic index of graphs of even order with many edges. In: Journal of Graph Theory. 1984 ; Vol. 8, No. 4. pp. 463-470.

Bibtex

@article{f682a46ce74c406baa629f8b2e96af12,
title = "Chromatic index of graphs of even order with many edges.",
abstract = "We show that, for r = 1, 2, a graph G with 2n + 2 (6) vertices and maximum degree 2n + 1 - r is of Class 2 if and only if |E(G/v)| > () - rn, where v is a vertex of G of minimum degree, and we make a conjecture for 1 r n, of which this result is a special case. For r = 1 this result is due to Plantholt.",
author = "Chetwynd, {Amanda G.} and Hilton, {A. J. W.}",
year = "1984",
doi = "10.1002/jgt.3190080403",
language = "English",
volume = "8",
pages = "463--470",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "4",

}

RIS

TY - JOUR

T1 - Chromatic index of graphs of even order with many edges.

AU - Chetwynd, Amanda G.

AU - Hilton, A. J. W.

PY - 1984

Y1 - 1984

N2 - We show that, for r = 1, 2, a graph G with 2n + 2 (6) vertices and maximum degree 2n + 1 - r is of Class 2 if and only if |E(G/v)| > () - rn, where v is a vertex of G of minimum degree, and we make a conjecture for 1 r n, of which this result is a special case. For r = 1 this result is due to Plantholt.

AB - We show that, for r = 1, 2, a graph G with 2n + 2 (6) vertices and maximum degree 2n + 1 - r is of Class 2 if and only if |E(G/v)| > () - rn, where v is a vertex of G of minimum degree, and we make a conjecture for 1 r n, of which this result is a special case. For r = 1 this result is due to Plantholt.

U2 - 10.1002/jgt.3190080403

DO - 10.1002/jgt.3190080403

M3 - Journal article

VL - 8

SP - 463

EP - 470

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 4

ER -