Every Longest Hamiltonian path in odd n-gons

NIEL B.I.; REARTES W.A.; BRIGNOLE N.B.

Congreso; SIAM International Conference on Discrete Mathematics; 2010

We single out every longest path of n −1 order that solves each of the n/ 2 Longest Euclidean Hamiltonian Path Problems on the even n−th root of the unity, by means of a geometric and arithmetic procedure. This identification is done regardless planar rotations and orientation. In addition, the uniqueness of the Euclidean Hamiltonian cycle that resolves the Maximum Traveling Salesman Problem is shown.