Constructing dense graphs with unique Hamiltonian cycles

DOI10.1080/0020739X.2011.599876MaRDI QIDQ2883978zbMATH OpenOpenAlexFDO

Authors Mark A. M. Lynch

Publication date 14 May 2012

Published in International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0020739x.2011.599876

zbMATH Keywords

complete graphsdense graphsHamiltonian graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Density (toughness, etc.) (05C42) Eulerian and Hamiltonian graphs (05C45) Graph theory (educational aspects) (97K30)

Recommendations

• Some graphs containing unique Hamiltonian cycles
• On the number of Hamiltonian cycles in Hamiltonian dense graphs
• Finding hidden hamiltonian cycles
• On the construction and enumeration of Hamiltonian graphs
• Computational complexity of the Hamiltonian cycle problem in dense hypergraphs

Cited in

(2)

• Some graphs containing unique Hamiltonian cycles
• Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles

This page was built for publication: Constructing dense graphs with unique Hamiltonian cycles

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