On the spouse-loving variant of the Oberwolfach problem

DOI10.1002/JCD.21645zbMATH Open1415.05143OpenAlexW2910395593WikidataQ128623175 ScholiaQ128623175MaRDI QIDQ5225097FDOQ5225097

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

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

Recommendations

• scientific article; zbMATH DE number 3950583
• The solution of the bipartite analogue of the Oberwolfach problem
• Cycle decompositions. V: Complete graphs into cycles of arbitrary lengths
• A generalization of the Oberwolfach problem
• On the Oberwolfach problem with two similar length cycles

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)

Cited In (6)

• The Oberwolfach problem with loving couples
• On the Oberwolfach problem for single-flip 2-factors via graceful labelings
• A survey on constructive methods for the Oberwolfach problem and its variants
• 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
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225097)