On the spouse‐loving variant of the Oberwolfach problem

DOI10.1002/jcd.21645zbMath1415.05143OpenAlexW2910395593WikidataQ128623175 ScholiaQ128623175MaRDI QIDQ5225097

Mateja Šajna, Iona Buchanan, Ryan van Snick, Noah Bolohan, Andrea C. Burgess

Publication date: 19 July 2019

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.21645

zbMATH Keywords

2-factorizationOberwolfach problemcomplete graph plus a 1-factorresolvable minimum covering by cyclesspouse-loving variant

Mathematics Subject Classification ID

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

Related Items (3)

On the Oberwolfach problem for single-flip 2-factors via graceful labelings ⋮ Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length ⋮ A constructive solution to the Oberwolfach problem with a large cycle

This page was built for publication: On the spouse‐loving variant of the Oberwolfach problem