Upper Bound Constructions for Untangling Planar Geometric Graphs
From MaRDI portal
Publication:3223962
DOI10.1007/978-3-642-25878-7_28zbMath1271.05065OpenAlexW2274559613MaRDI QIDQ3223962
Javier Cano, Jorge 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
Graph theory (including graph drawing) in computer science (68R10) Polytopes and polyhedra (52B99) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Untangling planar graphs from a specified vertex position-Hard cases
- Untangling polygons and graphs
- A polynomial bound for untangling geometric planar graphs
- Untangling a planar graph
- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
- Untangling a polygon
- On Hamiltonian Circuits