The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.

DOI10.1016/S0304-3975(02)00650-3zbMath1044.68135OpenAlexW2676800707WikidataQ114121099 ScholiaQ114121099MaRDI QIDQ1401313

Brett Stevens

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00650-3

zbMATH Keywords

complete bipartite graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Maximum packings of the complete graph with uniform length cycles ⋮ Cycle decompositions of complete multigraphs ⋮ On the generalized Oberwolfach problem ⋮ Pancomponented 2-factorizations of complete graphs

Cites Work

• The solution of the bipartite analogue of the Oberwolfach problem
• The Oberwolfach problem and factors of uniform odd length cycles
• Some observations on the oberwolfach problem
• Even cycle decompositions of complete graphs minus a 1‐factor
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.