## Finding Hamilton Paths and Circuits

On a graph, a *Hamilton's path* is a path that passes through all the vertices of the graph, each vertex exactly once. *Hamilton's path* which is a cycle is called *Hamilton's cycle*. *Circuit* is another term for a *closed* path. Connectivity of the graph is a necessary but not a sufficient condition for the existence of an Hamilton path.

There is no definite prescription for finding Hamilton paths. Start at a node and try your luck. The instructions for using the applet are available on a separate page and can also be read under the first tab directly in the applet.

What if applet does not run? |

(This applet was created to accompany *Excursions in Modern Mathematics*, Seventh Edition, by Peter Tannenbaum © Pearson Education. Reproduced with permission.)

|Activities| |Contact| |Front page| |Contents| |Store|

Copyright © 1996-2017 Alexander Bogomolny61212306 |