Explore relationships

Hamiltonian cycle

In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a cycle that visits each vertex exactly once.

Use + to expand a branch. Click a topic name to open its summary.