Regular graphs of high degree are 1-factorizable (1985)
by
A. G. Chetwynd
,
A. J. W. Hilton
| Venue: | PROC. LONDON MATH. SOC |
| Citations: | 12 - 4 self |
BibTeX
@ARTICLE{Chetwynd85regulargraphs,
author = {A. G. Chetwynd and A. J. W. Hilton},
title = {Regular graphs of high degree are 1-factorizable},
journal = {PROC. LONDON MATH. SOC},
year = {1985},
volume = {3},
number = {50},
pages = {193--206}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 to2n — 3, In — 4, or2n — 5. We also show that it is true for </(G)>$|K(G)|.
Citations
| 145 | Some theorems on abstract graphs - Dirac - 1952 |
| 34 | On an estimate of the chromatic class of a p-graph (in Russian), Diskret. Analiz 3 - Vizing - 1964 |
| 20 | On Hamilton’s ideals - Chvátal - 1972 |
| 11 | Premature sets of 1-factors, or, how not to schedule round-robin tournaments, DiscreteAppl.Math.,4(1982),pp.291–297 - Rosa, Wallis |
| 6 | On small graphs critical with respect to edgecolourings - Beineke, Fiorini - 1976 |
| 6 | On critical graphs with chromatic index4 - Jakobsen - 1974 |
| 3 | Graphs and Hypergraphs (North - Berge - 1973 |
| 2 | Chromatic index critical graphs of order 9 - Chetwynd, Yap - 1983 |
| 1 | Partial edge-colourings of complete graphs or of graphs which are nearly complete', Graph theory and combinatorics - CHETWYND, HILTON - 1984 |
| 1 | The chromatic class of graphs with a given order and a given number of vertices of maximum degree - CHETWYND, HILTON |
| 1 | Regular graphs and edge-chromatic number - FAUDREE, SHEEHAN |
| 1 | On the intricacy of combinatorial problems - OPENCOMB - 1984 |
