Upper Bound Constructions for Untangling Planar Geometric Graphs

DOI10.1007/978-3-642-25878-7_28MaRDI QIDQ3223962zbMATH OpenOpenAlexFDO

Authors Javier Cano, J. Urrutia, Csaba D. Tóth

Publication date 9 March 2012

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25878-7_28

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62) Polytopes and polyhedra (52B99)

Recommendations

• Upper bound constructions for untangling planar geometric graphs
• A polynomial bound for untangling geometric planar graphs
• A Polynomial Bound for Untangling Geometric Planar Graphs
• Untangling a planar graph
• Untangling a Planar Graph
• Untangling planar graphs from a specified vertex position-Hard cases
• Boundaries of planar graphs: a unified approach
• Tight bounds for linkages in planar graphs
• New upper bounds on the decomposability of planar graphs
• scientific article; zbMATH DE number 1500196

Cites work

• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• A polynomial bound for untangling geometric planar graphs
• On Hamiltonian Circuits
• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• Untangling a planar graph
• Untangling a polygon
• Untangling planar graphs from a specified vertex position-Hard cases
• Untangling polygons and graphs

Cited in

(9)

• Untangling planar graphs from a specified vertex position-Hard cases
• The utility of untangling
• Untangling polygons and graphs
• A polynomial bound for untangling geometric planar graphs
• The utility of untangling
• On collinear sets in straight-line drawings
• Upper bound constructions for untangling planar geometric graphs
• Untangling polygons and graphs
• Untangling circular drawings: algorithms and complexity

This page was built for publication: Upper Bound Constructions for Untangling Planar Geometric Graphs

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