Encyclopedia > Hamiltonian path

Article Content

Hamiltonian path

In mathematics, a Hamiltonian path in a graph is a path that visits each vertex precisely once. A Hamiltonian cycle is a cycle which visits each vertex once and only once.

This type of path is named after William Rowan Hamilton who invented a puzzle, now known as Hamilton's puzzle, about the construction of such paths.

See also

Euler path[?]

All Wikipedia text is available under the terms of the GNU Free Documentation License

Search Encyclopedia

Search over one million articles, find something about almost anything!

Featured Article

Sakhalin

... of the island. From the 32,000 Russians (of whom over 22,150 were convicts) at the beginning of 20th century, the population grew to 673,100 today, 83% from whom are ...