Weighted graphs with all Hamiltonian cycles of the same length

DOI10.1016/S0012-365X(03)00041-4zbMath1022.05044MaRDI QIDQ1408871

Abraham P. Punnen, Santosh N. Kabadi

Publication date: 25 September 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cyclestraveling salesman problemHamiltonian paths

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

The Rank-One Quadratic Assignment Problem ⋮ Quadratic bottleneck problems ⋮ SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts ⋮ Three value TSP and linkages with the three value linear spanning 2-forests ⋮ Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems

Cites Work

• Recognition of Gilmore-Gomory traveling salesman problem
• Graphs in which all Hamiltonian cycles have the same length
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weighted graphs with all Hamiltonian cycles of the same length