EVERY LONGEST HAMILTONIAN PATH IN EVEN n-GONS

DOI10.1142/S1793830912500577zbMath1257.05080MaRDI QIDQ4903643

Blanca Isabel Niel

Publication date: 24 January 2013

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

extremal problemstraveling salesman problemHamiltonian pathEuclidean geometric problemfurthest neighbor tours

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45) Signed and weighted graphs (05C22)

Related Items

Winding indexes of Max. and Min. Hamiltonians in N-Gons

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item