A graph cycle (closed loop) through a graph that visits each node exactly once. A graph possessing a Hamiltonian circuit is said to be a Hamiltonian graph. The Hamiltonian circuit is named after Sir William Rowan Hamilton, who devised a puzzle in which such a path along the edges of an icosahedron was sought.

Sign up

Need help? accounthelp@everything2.com