Hamiltonian graph
A graph that has a cycle visiting every vertex exactly once.
A graph is Hamiltonian if it contains a Hamiltonian cycle -- a cycle passing through every vertex exactly once.
See also
Point table
Graph settings
Calculator