Hamiltonian cycles on random lattices of arbitrary genus

Saburo Higuchi

A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It has been difficult to count the number of Hamiltonian cycles on regular lattices wit…