Home > Research > Publications & Outputs > On the Δ-subgraph of graphs which are critical ...

Research

Links

Text available via DOI:

View graph of relations

On the Δ-subgraph of graphs which are critical with respect to the chromatic index.

Research output: Contribution to Journal/Magazine › Journal article

Published

Standard

On the Δ-subgraph of graphs which are critical with respect to the chromatic index. / Chetwynd, Amanda G.; Hilton, A. J. W.; Hoffman, D. G.
In: Journal of Combinatorial Theory, Series B, Vol. 46, No. 2, 04.1989, p. 240-275.

Research output: Contribution to Journal/Magazine › Journal article

Harvard

Chetwynd, AG, Hilton, AJW & Hoffman, DG 1989, 'On the Δ-subgraph of graphs which are critical with respect to the chromatic index.', Journal of Combinatorial Theory, Series B, vol. 46, no. 2, pp. 240-275. https://doi.org/10.1016/0095-8956(89)90045-2

APA

Chetwynd, A. G., Hilton, A. J. W., & Hoffman, D. G. (1989). On the Δ-subgraph of graphs which are critical with respect to the chromatic index. Journal of Combinatorial Theory, Series B, 46(2), 240-275. https://doi.org/10.1016/0095-8956(89)90045-2

Vancouver

Chetwynd AG, Hilton AJW, Hoffman DG. On the Δ-subgraph of graphs which are critical with respect to the chromatic index. Journal of Combinatorial Theory, Series B. 1989 Apr;46(2):240-275. doi: 10.1016/0095-8956(89)90045-2

Author

Chetwynd, Amanda G. ; Hilton, A. J. W. ; Hoffman, D. G. / On the Δ-subgraph of graphs which are critical with respect to the chromatic index. In: Journal of Combinatorial Theory, Series B. 1989 ; Vol. 46, No. 2. pp. 240-275.

Bibtex

@article{a727230679864a13a32fe47e99ff15d9,
title = "On the Δ-subgraph of graphs which are critical with respect to the chromatic index.",
abstract = "The Δ-subgraph of a simple graph G is the subgraph of G induced by the vertices of maximum degree Δ = Δ(G). We show that a non-empty simple graph H can be a Δ-subgraph of a graph G, which is critical with respect to the chromatic index, if and only if H has no vertices of degree 0 or 1.",
author = "Chetwynd, {Amanda G.} and Hilton, {A. J. W.} and Hoffman, {D. G.}",
year = "1989",
month = apr,
doi = "10.1016/0095-8956(89)90045-2",
language = "English",
volume = "46",
pages = "240--275",
journal = "Journal of Combinatorial Theory, Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "2",

}

RIS

TY - JOUR

T1 - On the Δ-subgraph of graphs which are critical with respect to the chromatic index.

AU - Chetwynd, Amanda G.

AU - Hilton, A. J. W.

AU - Hoffman, D. G.

PY - 1989/4

Y1 - 1989/4

N2 - The Δ-subgraph of a simple graph G is the subgraph of G induced by the vertices of maximum degree Δ = Δ(G). We show that a non-empty simple graph H can be a Δ-subgraph of a graph G, which is critical with respect to the chromatic index, if and only if H has no vertices of degree 0 or 1.

AB - The Δ-subgraph of a simple graph G is the subgraph of G induced by the vertices of maximum degree Δ = Δ(G). We show that a non-empty simple graph H can be a Δ-subgraph of a graph G, which is critical with respect to the chromatic index, if and only if H has no vertices of degree 0 or 1.

U2 - 10.1016/0095-8956(89)90045-2

DO - 10.1016/0095-8956(89)90045-2

M3 - Journal article

VL - 46

SP - 240

EP - 275

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

SN - 0095-8956

IS - 2

ER -