Regular Multigraphs of High Degree are 1-Factorizable

DOI10.1112/JLMS/S2-44.3.393MaRDI QIDQ4009246zbMATH OpenOpenAlexFDO

Authors Shailesh K. Tipnis, Michael J. Plantholt

Publication date 27 September 1992

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-44.3.393

zbMATH Keywords

1-factorizablechromatic indexconjecture by Goldbergmultigraphmultiplicityregular graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• All regular multigraphs of even order and high degree are 1-factorable
• Overfull conjecture for graphs with high minimum degree
• Regular Graphs of High Degree are 1-Factorizable
• Edge coloring regular graphs of high degree
• The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\)

Cited in

(8)

• Edge coloring regular graphs of high degree
• An asymptotic version of the multigraph 1-factorization conjecture
• The number of disjoint perfect matchings in semi-regular graphs
• Regular Graphs of High Degree are 1-Factorizable
• All regular multigraphs of even order and high degree are 1-factorable
• Approximating the chromatic index of multigraphs
• On the multigraph overfull conjecture
• Graph factors and factorization: 1985--2003: a survey

This page was built for publication: Regular Multigraphs of High Degree are 1-Factorizable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4009246)