On the construction and enumeration of Hamiltonian graphs (Q1309137)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the construction and enumeration of Hamiltonian graphs |
scientific article; zbMATH DE number 468863
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the construction and enumeration of Hamiltonian graphs |
scientific article; zbMATH DE number 468863 |
Statements
On the construction and enumeration of Hamiltonian graphs (English)
0 references
22 June 1994
0 references
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.
0 references
enumeration
0 references
Hamiltonian graphs
0 references
dihedral group
0 references
