Regular Multigraphs of High Degree are 1-Factorizable

DOI10.1112/jlms/s2-44.3.393zbMath0760.05073OpenAlexW2085379850MaRDI QIDQ4009246

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

multigraphmultiplicityregular graphchromatic index1-factorizableconjecture by Goldberg

Mathematics Subject Classification ID

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

Related Items (4)

The number of disjoint perfect matchings in semi-regular graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Approximating the chromatic index of multigraphs ⋮ An Asymptotic Version of the Multigraph 1‐Factorization Conjecture

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