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

DOI10.1142/S1793830917500616zbMath1386.05049OpenAlexW2744732957WikidataQ114071646 ScholiaQ114071646MaRDI QIDQ4595250

Blanca Isabel Niel

Publication date: 29 November 2017

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

Full work available at URL: https://doi.org/10.1142/s1793830917500616

zbMATH Keywords

networksHamiltonian cyclesregular figures\(N\)-gonsbistarred Hamiltonian cyclesextremal geometric problemswinding indexes

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Polyhedra and polytopes; regular figures, division of spaces (51M20) Distance in graphs (05C12) Reflection groups, reflection geometries (51F15) Signed and weighted graphs (05C22)

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polygons: Meister was right and Poinsot was wrong but prevailed
• Invariants of curves and fronts via Gauss diagrams
• Untangling planar curves
• The traveling salesman problem and its variations.
• Traveling the boundary of Minkowski sums.
• Constructible Approximations of Regular Polygons
• Rotation and Winding Numbers for Planar Polygons and Curves
• The geometric maximum traveling salesman problem
• Constructive Whitney–Graustein Theorem: Or How to Untangle Closed Planar Curves
• Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems
• EVERY LONGEST HAMILTONIAN PATH IN EVEN n-GONS

This page was built for publication: Winding indexes of Max. and Min. Hamiltonians in N-Gons