Graphs with few Hamiltonian Cycles

Jan Goedgebeur, Barbara Meersman, Carol T. Zamfirescu

We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number $k\ge 0$ of hamiltonian cycles, which is especially efficient for small $k$. Ou…