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

DOI10.1016/S0167-6377(99)00075-9MaRDI QIDQ1977262zbMATH OpenFDO

Authors Ruud H. Teunter, Edo S. van der Poort

Publication date 29 October 2000

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

Full work available at URL https://doi.org/10.1016/S0167-6377(99)00075-9

zbMATH Keywords

Hamiltonian cyclestraveling salesman

Mathematics Subject Classification ID

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

Recommendations

• On the number of cycles in a graph
• On the number of Hamiltonian cycles in Hamiltonian dense graphs
• The maximum number of cycles in a graph with fixed number of edges
• scientific article; zbMATH DE number 3979096
• On the number of Hamiltonian cycles in Dirac graphs

Cites work

• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Hamiltonian cycles in a graph of degree 4
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• scientific article; zbMATH DE number 3292649 (Why is no real title available?)
• On Hamiltonian Circuits
• On the number of hamilton cycles in a random graph
• Stability aspects of the traveling salesman problem based on \(k\)-best solutions

Cited in

(3)

• scientific article; zbMATH DE number 3979096 (Why is no real title available?)
• Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles
• The minimum number of Hamilton cycles in a Hamiltonian threshold graph of a prescribed order

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1977262)