Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles

DOI10.1016/S0097-3165(03)00098-0zbMath1022.05061MaRDI QIDQ1399917

Mateja Šajna, Helen Verrall, Heather Jordon, Brian Alspach

Publication date: 30 July 2003

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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)

Related Items (33)

\(2p\)-cycle decompositions of some regular graphs and digraphs ⋮ Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs ⋮ Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking ⋮ Note on three table Oberwolfach problem ⋮ Almost 2-perfect 6-cycle systems ⋮ Unnamed Item ⋮ Decompositions of complete symmetric directed graphs into the oriented heptagons ⋮ On the directed Oberwolfach problem with equal cycle lengths ⋮ Doubly even orientable closed 2-cell embeddings of the complete graph ⋮ Completing the solution of the directed Oberwolfach problem with cycles of equal length ⋮ A new proof for the Erdős-Ko-Rado theorem for the alternating group ⋮ Round-robin tournaments with homogeneous rounds ⋮ Cycle decompositions of complete digraphs ⋮ Coverings and packings of complete directed graphs by odd circuits ⋮ Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length ⋮ Arc-transitive cycle decompositions of tetravalent graphs ⋮ Closed trail decompositions of complete equipartite graphs ⋮ Decompositions of some regular graphs into unicyclic graphs of order five ⋮ Strong difference families over arbitrary graphs ⋮ A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations ⋮ Cycle decompositions of complete multigraphs ⋮ Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph ⋮ On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\) ⋮ Unnamed Item ⋮ Six-cycle systems ⋮ Cycle decompositions of complete multigraphs ⋮ Signed Langford sequences ⋮ Geometrical constructions of class-uniformly resolvable structure ⋮ Closed trail decompositions of some classes of regular graphs ⋮ Determination of the packing number \(D_{\lambda }(3,W_4^{(3)},\nu )\) ⋮ Directed paths of diagonals within polygons ⋮ Brian Alspach and his work ⋮ Labeled packing of cycles and circuits

Cites Work

• Hamiltonian decomposition of Cayley graphs of degree 4
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Decomposition of the complete directed graph into k-circuits
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions III: Complete graphs and fixed length cycles
• On the construction of odd cycle systems

This page was built for publication: Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles