Proceedings of the London Mathematical Society · 1985 · 95 citations · 6 references
Natural SciencesMathematicsAlgebraCombinatoricsGeometryGraph AlgorithmsGraph TheoryAlgebraic Graph TheoryFactor Graphs
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) ⩾ 6 7 |V(G)|.
6
Some Theorems on Abstract Graphs
G. A. Dirac · Proceedings of the London Mathematical Society · 1952 · 1.6K citations
Vašek Chvátal · Journal of Combinatorial Theory Series B · 1972 · 312 citations
On critical graphs with chromatic index 4
Ivan Tafteberg Jakobsen · Discrete Mathematics · 1974 · 59 citations