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

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

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

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Chetwynd, A.G., Hilton, A.J.W.
Format: Buchkapitel
Sprache:eng
Schlagworte:
Combinatorics & graph theory
Optimization
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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)|.
ISSN:0167-5060
DOI:10.1016/S0167-5060(08)70570-3