Home > Research > Publications & Outputs > A Δ-subgraph condition for a graph to be class 1.
View graph of relations

A Δ-subgraph condition for a graph to be class 1.

Research output: Contribution to Journal/MagazineJournal article

Published

Standard

A Δ-subgraph condition for a graph to be class 1. / Chetwynd, Amanda G.; Hilton, A. J. W.
In: Journal of Combinatorial Theory, Series B, Vol. 46, No. 1, 02.1989, p. 37-45.

Research output: Contribution to Journal/MagazineJournal article

Harvard

Chetwynd, AG & Hilton, AJW 1989, 'A Δ-subgraph condition for a graph to be class 1.', Journal of Combinatorial Theory, Series B, vol. 46, no. 1, pp. 37-45. https://doi.org/10.1016/0095-8956(89)90005-1

APA

Chetwynd, A. G., & Hilton, A. J. W. (1989). A Δ-subgraph condition for a graph to be class 1. Journal of Combinatorial Theory, Series B, 46(1), 37-45. https://doi.org/10.1016/0095-8956(89)90005-1

Vancouver

Chetwynd AG, Hilton AJW. A Δ-subgraph condition for a graph to be class 1. Journal of Combinatorial Theory, Series B. 1989 Feb;46(1):37-45. doi: 10.1016/0095-8956(89)90005-1

Author

Chetwynd, Amanda G. ; Hilton, A. J. W. / A Δ-subgraph condition for a graph to be class 1. In: Journal of Combinatorial Theory, Series B. 1989 ; Vol. 46, No. 1. pp. 37-45.

Bibtex

@article{cae24bedb8a941b2b29d33083616fb2c,
title = "A Δ-subgraph condition for a graph to be class 1.",
abstract = "The Δ-subgraph GΔ of a simple graph G is the subgraph of G induced by the vertices of maximum degree Δ = Δ(G). We prove a number of results to the effect that if Δ(G) is large and the minimum degree of GΔ is at most one, then G satisfies χ′(G) = Δ(G), where χ′(G) is the edge-chromatic number of G.",
author = "Chetwynd, {Amanda G.} and Hilton, {A. J. W.}",
year = "1989",
month = feb,
doi = "10.1016/0095-8956(89)90005-1",
language = "English",
volume = "46",
pages = "37--45",
journal = "Journal of Combinatorial Theory, Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "1",

}

RIS

TY - JOUR

T1 - A Δ-subgraph condition for a graph to be class 1.

AU - Chetwynd, Amanda G.

AU - Hilton, A. J. W.

PY - 1989/2

Y1 - 1989/2

N2 - The Δ-subgraph GΔ of a simple graph G is the subgraph of G induced by the vertices of maximum degree Δ = Δ(G). We prove a number of results to the effect that if Δ(G) is large and the minimum degree of GΔ is at most one, then G satisfies χ′(G) = Δ(G), where χ′(G) is the edge-chromatic number of G.

AB - The Δ-subgraph GΔ of a simple graph G is the subgraph of G induced by the vertices of maximum degree Δ = Δ(G). We prove a number of results to the effect that if Δ(G) is large and the minimum degree of GΔ is at most one, then G satisfies χ′(G) = Δ(G), where χ′(G) is the edge-chromatic number of G.

U2 - 10.1016/0095-8956(89)90005-1

DO - 10.1016/0095-8956(89)90005-1

M3 - Journal article

VL - 46

SP - 37

EP - 45

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

SN - 0095-8956

IS - 1

ER -