Home > Research > Publications & Outputs > The edge chromatic class of graphs with maximum...

Research

Links

Text available via DOI:

View graph of relations

The edge chromatic class of graphs with maximum degree at least $|V| - 3$.

Research output: Contribution to Journal/Magazine › Journal article

Published

Standard

The edge chromatic class of graphs with maximum degree at least $|V| - 3$. / Chetwynd, Amanda G.; Hilton, A. J. W.
In: Annals of Discrete Mathematics, Vol. 41, No. C, 1988, p. 91-110.

Research output: Contribution to Journal/Magazine › Journal article

Harvard

Chetwynd, AG & Hilton, AJW 1988, 'The edge chromatic class of graphs with maximum degree at least $|V| - 3$.', Annals of Discrete Mathematics, vol. 41, no. C, pp. 91-110. https://doi.org/10.1016/S0167-5060(08)70453-9

APA

Chetwynd, A. G., & Hilton, A. J. W. (1988). The edge chromatic class of graphs with maximum degree at least $|V| - 3$. Annals of Discrete Mathematics, 41(C), 91-110. https://doi.org/10.1016/S0167-5060(08)70453-9

Vancouver

Chetwynd AG, Hilton AJW. The edge chromatic class of graphs with maximum degree at least $|V| - 3$. Annals of Discrete Mathematics. 1988;41(C):91-110. doi: 10.1016/S0167-5060(08)70453-9

Author

Chetwynd, Amanda G. ; Hilton, A. J. W. / The edge chromatic class of graphs with maximum degree at least $|V| - 3$. In: Annals of Discrete Mathematics. 1988 ; Vol. 41, No. C. pp. 91-110.

Bibtex

@article{b757af2f75b34413907cb743b88d89c8,
title = "The edge chromatic class of graphs with maximum degree at least $|V| - 3$.",
abstract = "We characterize the simple graphs G which satisfy Δ(G) ≥ |V(G)| – 3 and x'(G) = Δ(G), where x'(G) is the chromatic index of G and Δ(G) is the maximum degree of G.",
author = "Chetwynd, {Amanda G.} and Hilton, {A. J. W.}",
year = "1988",
doi = "10.1016/S0167-5060(08)70453-9",
language = "English",
volume = "41",
pages = "91--110",
journal = "Annals of Discrete Mathematics",
issn = "0167-5060",
publisher = "Elsevier",
number = "C",

}

RIS

TY - JOUR

T1 - The edge chromatic class of graphs with maximum degree at least $|V| - 3$.

AU - Chetwynd, Amanda G.

AU - Hilton, A. J. W.

PY - 1988

Y1 - 1988

N2 - We characterize the simple graphs G which satisfy Δ(G) ≥ |V(G)| – 3 and x'(G) = Δ(G), where x'(G) is the chromatic index of G and Δ(G) is the maximum degree of G.

AB - We characterize the simple graphs G which satisfy Δ(G) ≥ |V(G)| – 3 and x'(G) = Δ(G), where x'(G) is the chromatic index of G and Δ(G) is the maximum degree of G.

U2 - 10.1016/S0167-5060(08)70453-9

DO - 10.1016/S0167-5060(08)70453-9

M3 - Journal article

VL - 41

SP - 91

EP - 110

JO - Annals of Discrete Mathematics

JF - Annals of Discrete Mathematics

SN - 0167-5060

IS - C

ER -