Untangling polygons and graphs

DOI10.1016/j.endm.2008.06.041zbMath1267.05175OpenAlexW2048119345MaRDI QIDQ5301008

Josef Cibulka

Publication date: 28 June 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.041

zbMATH Keywords

untanglingmoving verticesnumber of fixed verticesstraight-line plane drawing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

A polynomial bound for untangling geometric planar graphs ⋮ Untangling a planar graph

Cites Work

• Untangling a polygon
• A Polynomial Bound for Untangling Geometric Planar Graphs
• Untangling a Planar Graph
• Trees in Polyhedral Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Untangling polygons and graphs