The spectrum of maximal sets of one-factors

DOI10.1016/0012-365X(91)90450-GzbMath0758.05086OpenAlexW2005806883MaRDI QIDQ1184003

R. S. Rees, Walter D. Wallis

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90450-g

zbMATH Keywords

spectrummaximal sets of one-factors

Mathematics Subject Classification ID

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

Related Items (6)

Unnamed Item ⋮ Maximal sets of Hamilton cycles inKn,n ⋮ A greedy algorithm for the social golfer and the Oberwolfach problem ⋮ A tutorial on graph models for scheduling round‐robin sports tournaments ⋮ Maximal edge colorings of graphs ⋮ Regular factors of simple regular graphs and factor-spectra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Premature sets of 1-factors or how not to schedule round robin tournaments
• One-factorizations of the complete graph—A survey
• Regular Graphs of High Degree are 1-Factorizable

This page was built for publication: The spectrum of maximal sets of one-factors