 |
|
| A B C D E F G H I J K L M N O P Q R S T U V W X Y Z |
| • HOME • ABOUT • CATEGORIES • USE OF TEXT AND IMAGES • NEWSLETTER   
|
Hamilton path
Named after William Hamilton, a path that traverses every vertex of a connected graph once and only once. The problem of the knight's tour is equivalent to finding a Hamilton path (or, in the case, of a reentrant tour, a Hamilton circuit) that corresponds to the legal moves of the knight. Compare with Euler path.
Related category
• GRAPHS AND GRAPH THEORYAlso on this site:
Encyclopedia of Alternative Energy & Sustainable Living
Encyclopedia of History