Home > Research > Publications & Outputs > Regular Graphs of High Degree are 1-Factorizable.

Research

Links

Text available via DOI:

View graph of relations

Regular Graphs of High Degree are 1-Factorizable.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Regular Graphs of High Degree are 1-Factorizable. / Chetwynd, Amanda G.; Hilton, A. J. W.
In: Proceedings of the London Mathematical Society, Vol. Series, No. 2, 03.1985, p. 193-206.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Chetwynd, AG & Hilton, AJW 1985, 'Regular Graphs of High Degree are 1-Factorizable.', Proceedings of the London Mathematical Society, vol. Series, no. 2, pp. 193-206. https://doi.org/10.1112/plms/s3-50.2.193

APA

Chetwynd, A. G., & Hilton, A. J. W. (1985). Regular Graphs of High Degree are 1-Factorizable. Proceedings of the London Mathematical Society, Series(2), 193-206. https://doi.org/10.1112/plms/s3-50.2.193

Vancouver

Chetwynd AG, Hilton AJW. Regular Graphs of High Degree are 1-Factorizable. Proceedings of the London Mathematical Society. 1985 Mar;Series(2):193-206. doi: 10.1112/plms/s3-50.2.193

Author

Chetwynd, Amanda G. ; Hilton, A. J. W. / Regular Graphs of High Degree are 1-Factorizable. In: Proceedings of the London Mathematical Society. 1985 ; Vol. Series, No. 2. pp. 193-206.

Bibtex

@article{6593db57bf02444398a92acfa7e4e0b7,
title = "Regular Graphs of High Degree are 1-Factorizable.",
abstract = "It is a well-known conjecture that if a regular graph G of order 2n has degree d(G) satisfying d(G) n, then G is the union of edge-disjoint 1-factors. It is well known that this conjecture is true for d(G) equal to 2n—1 or 2n—2. We show here that it is true for d(G) equal to 2n — 3, 2n — 4, or 2n — 5. We also show that it is true for d(G) |V(G)|.",
author = "Chetwynd, {Amanda G.} and Hilton, {A. J. W.}",
year = "1985",
month = mar,
doi = "10.1112/plms/s3-50.2.193",
language = "English",
volume = "Series",
pages = "193--206",
journal = "Proceedings of the London Mathematical Society",
issn = "1460-244X",
publisher = "Oxford University Press",
number = "2",

}

RIS

TY - JOUR

T1 - Regular Graphs of High Degree are 1-Factorizable.

AU - Chetwynd, Amanda G.

AU - Hilton, A. J. W.

PY - 1985/3

Y1 - 1985/3

N2 - It is a well-known conjecture that if a regular graph G of order 2n has degree d(G) satisfying d(G) n, then G is the union of edge-disjoint 1-factors. It is well known that this conjecture is true for d(G) equal to 2n—1 or 2n—2. We show here that it is true for d(G) equal to 2n — 3, 2n — 4, or 2n — 5. We also show that it is true for d(G) |V(G)|.

AB - It is a well-known conjecture that if a regular graph G of order 2n has degree d(G) satisfying d(G) n, then G is the union of edge-disjoint 1-factors. It is well known that this conjecture is true for d(G) equal to 2n—1 or 2n—2. We show here that it is true for d(G) equal to 2n — 3, 2n — 4, or 2n — 5. We also show that it is true for d(G) |V(G)|.

U2 - 10.1112/plms/s3-50.2.193

DO - 10.1112/plms/s3-50.2.193

M3 - Journal article

VL - Series

SP - 193

EP - 206

JO - Proceedings of the London Mathematical Society

JF - Proceedings of the London Mathematical Society

SN - 1460-244X

IS - 2

ER -