◀ ▲ ▶Branches / Graphtheory / Lemma: Biconnectivity is a Necessary Condition for a Hamiltonian Graph
Lemma: Biconnectivity is a Necessary Condition for a Hamiltonian Graph
If a simple graph \(G(V,E)\) is Hamiltonian, then it must be at least biconnected.
Equivalently,
If a simple graph \(G(V,E)\) is either disconnected or only connected, but not biconnected, then it is not Hamiltonian.
Table of Contents
Proofs: 1
Mentioned in:
Proofs: 1
Thank you to the contributors under CC BYSA 4.0!
 Github:

References
Bibliography
 Piotrowski, Andreas: Own Research, 2014