Multi-switch: A tool for finding potential edge-disjoint 1-factors

DOI10.5614/ejgta.2021.9.1.8zbMath1468.05039arXiv1508.00079OpenAlexW3158328385MaRDI QIDQ4958048

Tyler Seacrest

Publication date: 6 September 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.00079

zbMATH Keywords

graphmatchingdegree sequenceKundu's theorem

Mathematics Subject Classification ID

Vertex degrees (05C07)

Related Items (2)

Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem ⋮ LegendreSobolev

Cites Work

• Unnamed Item
• A short proof of Kundu's k-factor theorem
• The k-factor conjecture is true
• Packing of graphic n-tuples
• NP completeness of finding the chromatic index of regular graphs

This page was built for publication: Multi-switch: A tool for finding potential edge-disjoint 1-factors