Completing the solution of the directed Oberwolfach problem with cycles of equal length

DOI10.1002/jcd.21918arXiv2212.12072OpenAlexW4387057486MaRDI QIDQ6187009

Unnamed Author

Publication date: 5 February 2024

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

Full work available at URL: https://arxiv.org/abs/2212.12072

zbMATH Keywords

complete symmetric digraphdirected Oberwolfach problemMendelsohn designresolvable directed cycle decomposition

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On the directed Oberwolfach problem with equal cycle lengths
• Hamiltonian decomposition of Cayley graphs of degree 4
• Hamiltonian decomposition of lexicographic products of digraphs
• On a variation of the Oberwolfach problem
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• Resolvable decomposition of \(K^*_n\)
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Resolvable perfect Mendelsohn designs with block size five
• The Oberwolfach problem and factors of uniform odd length cycles
• Resolvable Mendelsohn designs with block size 4
• Some observations on the oberwolfach problem
• On the directed Oberwolfach Problem with equal cycle lengths: the odd case

This page was built for publication: Completing the solution of the directed Oberwolfach problem with cycles of equal length