Definition: Hamiltonian Graph
A Hamiltionian graph is a simple graph \(G(V,E)\) that contains a Hamiltonian cycle.
Table of Contents
- Lemma: Biconnectivity is a Necessary Condition for a Hamiltonian Graph
- Lemma: Dual Graph of a All Faces Contained in a Planar Hamiltonian Cycle is a Tree
- Theorem: Characterization of Planar Hamiltonian Graphs
Mentioned in:
Lemmas: 1 2
Proofs: 3 4 5 6
Theorems: 7 8
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