A Method for Finding Hamilton Paths and Knight's Tours

The use of Warnsdorff's rule for finding a
knight's tour is generalized and applied to the 
problem of finding a Hamilton path in a graph.  A graph-theoretic
justification for the method is given.

CACM July, 1967

Pohl, I.

CA670710 JB February 28, 1978  8:28 AM

1563	5	1563
1563	5	1563
1563	5	1563