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

Chetwynd, A. G. and Hilton, A. J.W. (1989) 1-Factorizing Regular Graphs of High Degree-an Improved Bound. Annals of Discrete Mathematics, 43 (C). pp. 103-112. ISSN 0167-5060

Full text not available from this repository.

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)|.

Item Type:
Journal Article
Journal or Publication Title:
Annals of Discrete Mathematics
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2600/2607
Subjects:
Departments:
ID Code:
128711
Deposited By:
Deposited On:
05 Nov 2018 16:16
Refereed?:
Yes
Published?:
Published
Last Modified:
01 Jan 2020 11:38