The Number of Flips Required to Obtain Non-crossing Convex Cycles

DOI10.1007/978-3-540-89550-3_17zbMath1162.05330OpenAlexW17101045MaRDI QIDQ5302750

Yoshiaki Oda, Mamoru Watanabe

Publication date: 13 January 2009

Published in: Computational Geometry and Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89550-3_17

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

On the longest flip sequence to untangle segments in the plane ⋮ Complexity results on untangling red-blue matchings ⋮ Flip distance to some plane configurations ⋮ Flip Distance to some Plane Configurations.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The diameters of some transition graphs constructed from Hamilton cycles
• Untangling a polygon
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon
• Lengths of tours and permutations on a vertex set of a convex polygon.

This page was built for publication: The Number of Flips Required to Obtain Non-crossing Convex Cycles