Maximal sets of Hamilton cycles in \(K_{2p}-F\)

DOI10.1016/j.disc.2006.09.059zbMath1148.05044OpenAlexW2007790012MaRDI QIDQ924970

S. L. Logan, C. A. Rodger, Hung-Lin Fu

Publication date: 29 May 2008

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

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

zbMATH Keywords

complete graphscomplete bipartite graphsmaximalcomplete multipartite graphsamalgamationsedge disjoint hamilton cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Exact values of multicolor Ramsey numbers \(R_l(C_{\le l+1})\) ⋮ Maximal sets of Hamilton cycles in \(D_n\) ⋮ Hamilton decompositions of balanced complete multipartite graphs with primitive leaves ⋮ Hamilton decompositions of graphs with primitive complements

Cites Work

• Unnamed Item
• Unnamed Item
• Maximal sets of 2-factors and Hamiltonian cycles
• Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
• Maximal sets of hamilton cycles in complete multipartite graphs
• Maximal sets of Hamilton cycles inKn,n

This page was built for publication: Maximal sets of Hamilton cycles in \(K_{2p}-F\)