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

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

... to be more common in females than males. Urethritis is a common cause of dysuria[?] (pain when urinating). Related to urethritis is so called urethral syndrome[?] ...

This page was created in 28.8 ms