Upper Bound Constructions for Untangling Planar Geometric Graphs

DOI10.1137/130924172zbMath1309.05051OpenAlexW2103283650MaRDI QIDQ5246094

Javier Cano, Jorge Urrutia, Csaba D. Tóth

Publication date: 17 April 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/130924172

zbMATH Keywords

Erdős-Szekeres theoremgeometric graphplanar graphuntangling

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

Dual circumference and collinear sets ⋮ Drawing Planar Graphs with Many Collinear Vertices ⋮ Aligned Drawings of Planar Graphs ⋮ Every collinear set in a planar graph is free ⋮ Unnamed Item ⋮ Aligned Drawings of Planar Graphs

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