Constructing dense graphs with unique Hamiltonian cycles

DOI10.1080/0020739X.2011.599876zbMath1433.97004OpenAlexW2019758609MaRDI QIDQ2883978

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 graphsHamiltonian graphsdense graphs

Mathematics Subject Classification ID

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

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