Systematic generation of Hamiltonian circuits
Sanford M. Roberts, Benito Flores · Communications of the ACM · 1966
For a combinatorial matrix which may specify both directed and nondirected arcs, the paper describes a computer program which generates systematically and exhaustively all the Hamiltonian circuits. Specific application is made to the “traveling salesman” problem.