On the directed Oberwolfach problem with equal cycle lengths

MaRDI QIDQ405089zbMATH OpenFDO

Authors Mateja Šajna, Andrea 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

complete symmetric digraphdirected Oberwolfach problemMendelsohn designresolvable directed cycle decomposition

Mathematics Subject Classification ID

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

Review text

Summary: We examine the necessary and sufficient conditions for a complete symmetric digraph \(K_n^\ast\) to admit a resolvable decomposition into directed cycles of length \(m\). We give a complete solution for even \(m\), and a partial solution for odd \(m\).

Recommendations

• On the directed Oberwolfach Problem with equal cycle lengths: the odd case
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Cycle decompositions of complete digraphs
• The directed anti-Oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order
• Directed odd cycle decompositions of some regular digraphs

Cites work

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

Cited in

(12)

• On decomposition of the Cartesian product of directed cycles into cycles of equal lengths
• Cycle decompositions of complete digraphs
• scientific article; zbMATH DE number 1792673 (Why is no real title available?)
• On the directed Oberwolfach Problem with equal cycle lengths: the odd case
• The directed anti-Oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order
• 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
• A survey on constructive methods for the Oberwolfach problem and its variants
• Completing the solution of the directed Oberwolfach problem with two tables
• The directed Oberwolfach problem with variable cycle lengths: a recursive construction
• On the directed Hamilton-Waterloo problem with two cycle sizes
• The directed uniform Hamilton-Waterloo problem involving even cycle sizes

This page was built for publication: On the directed Oberwolfach problem with equal cycle lengths

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