◀ ▲ ▶Branches / Graph-theory / Definition: Hamiltonian Cycle

Definition: Hamiltonian Cycle

A Hamiltonian cycle in a simple graph \(G(V,E)\) is a cycle that includes every vertex.

Table of Contents

1. Definition: Hamiltonian Graph

Mentioned in:

Lemmas: 1
Proofs: 2 3 4

Thank you to the contributors under CC BY-SA 4.0!

Github:

References

Bibliography

1. Aldous Joan M., Wilson Robin J.: "Graphs and Applications - An Introductory Approach", Springer, 2000