Definition: Hamiltonian Cycle
A Hamiltonian cycle in a simple graph \(G(V,E)\) is a cycle that includes every vertex.
Table of Contents
- Definition: Hamiltonian Graph
Mentioned in:
Lemmas: 1
Proofs: 2 3 4
Thank you to the contributors under CC BY-SA 4.0!
![](https://github.com/bookofproofs/bookofproofs.github.io/blob/main/_sources/_assets/images/calendar-black.png?raw=true)
- Github:
-
![bookofproofs](https://github.com/bookofproofs.png?size=32)
References
Bibliography
- Aldous Joan M., Wilson Robin J.: "Graphs and Applications - An Introductory Approach", Springer, 2000