Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph

DOI10.1016/J.DISC.2008.01.016zbMath1162.05024OpenAlexW2050946959MaRDI QIDQ1011715

Joy Morris, Heather Jordon

Publication date: 9 April 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.016

zbMATH Keywords

Hamiltonian cyclesdirected graphscyclic decompositionsdirected cyclic Hamiltonian cycle system

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Decomposition of the complete directed graph into k-circuits
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Skolem-type difference sets for cycle systems
• Cyclic Hamiltonian cycle systems of the complete graph.
• Cyclically decomposing the complete graph into cycles
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Existence of cyclic \(k\)-cycle systems of the complete graph
• On the cyclic decomposition of complete graphs into almost-bipartite graphs
• Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
• Cycle decompositions III: Complete graphs and fixed length cycles
• Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
• On the cyclic decompositions of the complete graph into polygons with odd number of edges

This page was built for publication: Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph