Maximal sets of Hamilton cycles in \(D_n\)

DOI10.1016/j.disc.2007.07.041zbMath1155.05041OpenAlexW3097709321MaRDI QIDQ932696

Hung-Lin Fu, Hao Shen, Liqun Pu

Publication date: 11 July 2008

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

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

zbMATH Keywords

complete directed graphdirected Hamilton cyclesmaximal sets

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Maximal sets of Hamilton cycles in \(K_{2p}-F\)
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Maximal sets of 2-factors and Hamiltonian cycles
• Long paths and cycles in oriented graphs
• Maximal sets of hamilton cycles in complete multipartite graphs
• Maximal sets of Hamilton cycles inKn,n