Open AccessLongest Hamiltonian in N<sub>odd-</sub>Gon
Author(s) -
Blanca Isabel Niel
Publication year - 2013
Publication title -
open journal of discrete mathematics
Language(s) - English
Resource type - Journals
eISSN - 2161-7643
pISSN - 2161-7635
DOI - 10.4236/ojdm.2013.32015
Subject(s) - hamiltonian path , mathematics , combinatorics , hamiltonian (control theory) , euclidean geometry , geometry , mathematical optimization , graph
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.