Untangling polygons and graphs

DOI10.1016/J.ENDM.2008.06.041zbMATH Open1267.05175OpenAlexW2048119345MaRDI QIDQ5301008FDOQ5301008

Authors: 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

Recommendations

• Untangling polygons and graphs
• A polynomial bound for untangling geometric planar graphs
• Untangling a planar graph
• Untangling a Planar Graph
• Upper Bound Constructions for Untangling Planar Geometric Graphs

zbMATH Keywords

untanglingmoving verticesnumber of fixed verticesstraight-line plane drawing

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Trees in Polyhedral Graphs
• Untangling a polygon
• A Polynomial Bound for Untangling Geometric Planar Graphs
• Untangling a Planar Graph

Cited In (12)

• Untangling a Planar Graph
• The utility of untangling
• Unravelling tangled graphs
• Untangling polygons and graphs
• A polynomial bound for untangling geometric planar graphs
• The utility of untangling
• Upper bound constructions for untangling planar geometric graphs
• Untangling a polygon
• Untangling a planar graph
• Title not available (Why is that?)
• Connecting polygonizations via stretches and twangs
• Untangling circular drawings: algorithms and complexity

This page was built for publication: Untangling polygons and graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301008)