A Hamiltonian graph (directed or undirected) is a graph that contains a Hamiltonian cycle, that is, a cycle that visits every vertex exactly once.
Dag Oskar Madsen
- 3.7k
- 3
- 28
- 51
