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
Class Warfare

... Press[?] in 1996. The contents runs as follows: Introduction Looking Ahead: Tenth Anniversary Interview (an interview conducted ten years since Barsamian first ...

 
 
 
This page was created in 39.2 ms