The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges

DOI10.1016/S0167-6377(99)00075-9zbMath0946.90100MaRDI QIDQ1977262

Ruud H. Teunter, Edo S. van der Poort

Publication date: 29 October 2000

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

traveling salesmanHamiltonian cycles

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability aspects of the traveling salesman problem based on \(k\)-best solutions
• On the number of hamilton cycles in a random graph
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Hamiltonian cycles in a graph of degree 4
• On Hamiltonian Circuits

This page was built for publication: The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges