Finding the Hamiltonian circuits in an undirected graph using the mesh-links incidence

This paper describes a new method of finding all the Hamiltonian circuits in an undirected graph, if such circuits exist. The method uses for the first time the mesh description of a graph and it is here applied in cubic graphs. A process to test Hamiltonicity, which runs in linear time, had been derived. Furthermore, a generalization of the algorithm extended to non-cubic and non-planar graphs is presented, too.