Home > Research > Publications & Outputs > 1-Factorizing Regular Graphs of High Degree-an ...

Research

Links

Text available via DOI:

View graph of relations

1-Factorizing Regular Graphs of High Degree-an Improved Bound

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

Published

Standard

1-Factorizing Regular Graphs of High Degree-an Improved Bound. / Chetwynd, A. G.; Hilton, A. J.W.
In: Annals of Discrete Mathematics, Vol. 43, No. C, 01.01.1989, p. 103-112.

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

Harvard

Chetwynd, AG & Hilton, AJW 1989, '1-Factorizing Regular Graphs of High Degree-an Improved Bound', Annals of Discrete Mathematics, vol. 43, no. C, pp. 103-112. https://doi.org/10.1016/S0167-5060(08)70570-3

APA

Chetwynd, A. G., & Hilton, A. J. W. (1989). 1-Factorizing Regular Graphs of High Degree-an Improved Bound. Annals of Discrete Mathematics, 43(C), 103-112. https://doi.org/10.1016/S0167-5060(08)70570-3

Vancouver

Chetwynd AG, Hilton AJW. 1-Factorizing Regular Graphs of High Degree-an Improved Bound. Annals of Discrete Mathematics. 1989 Jan 1;43(C):103-112. doi: 10.1016/S0167-5060(08)70570-3

Author

Chetwynd, A. G. ; Hilton, A. J.W. / 1-Factorizing Regular Graphs of High Degree-an Improved Bound. In: Annals of Discrete Mathematics. 1989 ; Vol. 43, No. C. pp. 103-112.

Bibtex

@article{949f1935465343ed86031e4e0c23a6e4,
title = "1-Factorizing Regular Graphs of High Degree-an Improved Bound",
abstract = "We showed eariler that a regular simple graph of even order satisfying d(G) » 6/7|V(G)| was the union of edge-disjoint 1-factors. Here we improve this to regular simple graphs of even order satisfying d(G)≥ 1/2(√7- 1)|V(G)|.",
author = "Chetwynd, {A. G.} and Hilton, {A. J.W.}",
year = "1989",
month = jan,
day = "1",
doi = "10.1016/S0167-5060(08)70570-3",
language = "English",
volume = "43",
pages = "103--112",
journal = "Annals of Discrete Mathematics",
issn = "0167-5060",
publisher = "Elsevier",
number = "C",

}

RIS

TY - JOUR

T1 - 1-Factorizing Regular Graphs of High Degree-an Improved Bound

AU - Chetwynd, A. G.

AU - Hilton, A. J.W.

PY - 1989/1/1

Y1 - 1989/1/1

N2 - We showed eariler that a regular simple graph of even order satisfying d(G) » 6/7|V(G)| was the union of edge-disjoint 1-factors. Here we improve this to regular simple graphs of even order satisfying d(G)≥ 1/2(√7- 1)|V(G)|.

AB - We showed eariler that a regular simple graph of even order satisfying d(G) » 6/7|V(G)| was the union of edge-disjoint 1-factors. Here we improve this to regular simple graphs of even order satisfying d(G)≥ 1/2(√7- 1)|V(G)|.

U2 - 10.1016/S0167-5060(08)70570-3

DO - 10.1016/S0167-5060(08)70570-3

M3 - Journal article

AN - SCOPUS:77957785499

VL - 43

SP - 103

EP - 112

JO - Annals of Discrete Mathematics

JF - Annals of Discrete Mathematics

SN - 0167-5060

IS - C

ER -