On the directed Oberwolfach problem with equal cycle lengths

zbMath1300.05114MaRDI QIDQ405089

Mateja Šajna, Andrea C. Burgess

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p15

zbMATH Keywords

complete symmetric digraphdirected Oberwolfach problemMendelsohn designresolvable directed cycle decomposition

Mathematics Subject Classification ID

Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Graph designs and isomorphic decomposition (05C51)

Related Items (4)

On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles ⋮ Completing the solution of the directed Oberwolfach problem with cycles of equal length ⋮ On decomposition of the Cartesian product of directed cycles into cycles of equal lengths ⋮ On the directed Oberwolfach Problem with equal cycle lengths: the odd case

Cites Work

• Unnamed Item
• Hamiltonian decomposition of Cayley graphs of degree 4
• 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
• The Oberwolfach problem and factors of uniform odd length cycles
• The equipartite Oberwolfach problem with uniform tables
• 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: On the directed Oberwolfach problem with equal cycle lengths