Abstract
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. 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. © 1967 ACM. All rights reserved.
Cite
CITATION STYLE
APA
Pohl, I. (1967). A method for finding Hamilton paths and Knight’s tours. Communications of the ACM, 10(7), 446–449. https://doi.org/10.1145/363427.363463
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free