Longest Hamiltonian in N<sub>odd-</sub>Gon

• 作者: Blanca I. Niel
• 来源期刊: 离散数学期刊(英文)
• 学科: 数学
• 关键词: HAMILTONIAN Path Extremal Problems Euclidean Geometric PROBLEM Farthest Neighbor Tours Traveling Salesman PROBLEM Geometry of ODD Regular POLYGONS
• 年，卷（期）: 2013,（2）
• 页码范围: 75-82
• 页数: 8页
• 分类号: O1

摘要

We single out the polygonal paths of nodd -1 order that solve each of the different longest non-cyclic Euclidean Hamiltonian path problems in networks by an arithmetic algorithm. As by product, the procedure determines the winding index of cyclic Hamiltonian polygonals on the vertices of a regular polygon.