An application of Tutte's theorem to 1-factorization of regular graphs of high degree

DOI10.1016/J.DISC.2008.05.046zbMath1213.05207OpenAlexW2052274980MaRDI QIDQ1044942

David Cariolaro, Anthony J. W. Hilton

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.05.046

zbMATH Keywords

1-factorizationTutte's 1-factor theorem1-factorization conjecture

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Latin hexahedra and related combinatorial structures ⋮ The chromatic index of strongly regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Premature sets of 1-factors or how not to schedule round robin tournaments
• The edge-chromatic class of regular graphs of degree 4 and their complements
• Matching theory
• 1-factorizing regular graphs of high degree - an improved bound
• Edge coloring regular graphs of high degree
• Chromatic index critical graphs of even order with five major vertices
• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• The NP-Completeness of Edge-Coloring
• Regular Graphs of High Degree are 1-Factorizable
• Some Theorems on Abstract Graphs

This page was built for publication: An application of Tutte's theorem to 1-factorization of regular graphs of high degree