All regular multigraphs of even order and high degree are 1-factorable

zbMath0981.05079MaRDI QIDQ5954314

Shailesh K. Tipnis, Michael J. Plantholt

Publication date: 7 February 2002

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/121634

zbMATH Keywords

one-factorization conjectureregular multigraph

Mathematics Subject Classification ID

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

Related Items

Proof of the 1-factorization and Hamilton Decomposition Conjectures ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ The chromatic index of multigraphs that are nearly full ⋮ Graph edge coloring: a survey ⋮ An Asymptotic Version of the Multigraph 1‐Factorization Conjecture