Hamiltonian Cycles and Travelling Salesfolk

Alberto Gomez Gomez

Abstract: A method is given in this paper that makes it easier to solve both the Hamiltonian cycle problem and the travelling salesman problem in any number of space dimensions and in both their directed and undirected varieties.

Keywords: NP-completeness, Hamiltonian cycle problem, travelling salesman problem, maximum matching, perfect matching