Maximal sets of Hamilton cycles in D_n

DOI10.1016/J.DISC.2007.07.041MaRDI QIDQ932696zbMATH OpenOpenAlexFDO

Authors Liqun Pu, Hung-Lin Fu, Hao Shen

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

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

Cites work

• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• scientific article; zbMATH DE number 3149611 (Why is no real title available?)
• Long paths and cycles in oriented graphs
• Maximal sets of 2-factors and Hamiltonian cycles
• Maximal sets of Hamilton cycles in \(K_{2p}-F\)
• Maximal sets of hamilton cycles in complete multipartite graphs
• Maximal sets of Hamilton cycles inKn,n

Cited in

(2)

• Maximal sets of 2-factors and Hamiltonian cycles
• On `maximal' Hamiltonian cycles in the square of a block

This page was built for publication: Maximal sets of Hamilton cycles in \(D_n\)

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