The Number of Flips Required to Obtain Non-crossing Convex Cycles
From MaRDI portal
Publication:5302750
DOI10.1007/978-3-540-89550-3_17zbMath1162.05330MaRDI QIDQ5302750
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
05C10: Planar graphs; geometric and topological aspects of graph theory
05C45: Eulerian and Hamiltonian graphs
Cites Work
- 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.
- Unnamed Item
- Unnamed Item
- Unnamed Item