On the Hamilton-Waterloo problem with a single factor of 6-cycles

DOI10.26493/1855-3974.3316.6D0MaRDI QIDQ7230471zbMATH OpenFDO

Authors Zazil Santizo Huerta, Melissa S. Keranen

Publication date 20 April 2026

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.26493/1855-3974.3316.6D0

zbMATH Keywords

2-factorizationscycle decompositionHamilton-Waterloo problemOberwolfach problemresolvable decompositions

Mathematics Subject Classification ID

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

Cites work

• A survey on constructive methods for the Oberwolfach problem and its variants
• Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Decomposition of the complete directed graph into k-circuits
• Hamilton decompositions of 6-regular Cayley graphs on even abelian groups with involution-free connections sets
• On the Hamilton-Waterloo problem
• Récréations mathématiques. 2e édition. Tome II.
• Some observations on the oberwolfach problem
• The Oberwolfach problem and factors of uniform odd length cycles
• The wonderful Walecki construction

This page was built for publication: On the Hamilton-Waterloo problem with a single factor of 6-cycles

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