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

DOI10.1016/S0304-3975(02)00650-3zbMATH Open1044.68135OpenAlexW2676800707WikidataQ114121099 ScholiaQ114121099MaRDI QIDQ1401313FDOQ1401313

Authors: 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

Recommendations

• Publication:4508368
• The directed anti-Oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order
• The solution of the bipartite analogue of the Oberwolfach problem
• Two-factorizations of the complete graph
• Pancomponented 2-factorizations of complete graphs

zbMATH Keywords

complete bipartite graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The solution of the bipartite analogue of the Oberwolfach problem
• The Oberwolfach problem and factors of uniform odd length cycles
• Title not available (Why is that?)
• Some observations on the oberwolfach problem
• Even cycle decompositions of complete graphs minus a 1‐factor
• The possible number of cycles in cycle systems
• Title not available (Why is that?)

Cited In (7)

• Maximum packings of the complete graph with uniform length cycles
• Cycle decompositions of complete multigraphs
• Pancomponented 2-factorizations of complete graphs
• A survey on constructive methods for the Oberwolfach problem and its variants
• On the generalized Oberwolfach problem
• Title not available (Why is that?)
• The directed anti-Oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order

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

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