On the construction and enumeration of Hamiltonian graphs
The authors deal with the enumeration and construction of Hamiltonian graphs and succeed in giving a formula for enumerating the equivalent classes of so-called orderly labeled Hamiltonian graphs under the dihedral group \(D_ n\), \(n\geq 3\). They conclude by presenting algorithms to generate Hamiltonian graphs recursively.
scientific article; zbMATH DE number 468863