## Uniquely hamiltonian graphs |

## Home## AuthorsBarbara Meersman |
## Uniquely hamiltonian graphs
The algorithms used in the generator are described in: -
J. Goedgebeur, B. Meersman and C.T. Zamfirescu,
*Graphs with few hamiltonian cycles*, Mathematics of Computation, 89:965-991, 2020 (arXiv).
The generator can be
- Download, extract and configure nauty (GenerateUHG requires nauty 2.5 or a more recent version).
- Compile the nauty libraries using: "make nautyW1.a"
- Copy the following files to the GenerateUHG directory: nausparse.h nauty.h nautyW1.a naututil.h planarity.c naurng.h splay.c planarity.h
- Compile using the command "make".
The Don't hesitate to contact us at jan.goedgebeur[at]ugent.be if you have any further questions or suggestions. |