Article ID: | iaor20052281 |
Country: | Netherlands |
Volume: | 26 |
Issue: | 2 |
Start Page Number: | 91 |
End Page Number: | 98 |
Publication Date: | Mar 2000 |
Journal: | Operations Research Letters |
Authors: | Teunter Ruud H., Poort Edo S. van der |
Keywords: | Hamiltonian cycle |
The problem studied in this paper is that of finding the maximum number of Hamiltonian cycles in a graph with a given number of vertices and edges. The main results are a lower bound and an upper bound, both given by closed-form formulas, for the maximum number of Hamiltonian cycles in a graph with a given number of vertices and edges.