Graphs That Admit Polyline Drawings with Few Crossing Angles

DOI10.1137/100819564zbMath1245.05024OpenAlexW2053608598MaRDI QIDQ2902903

Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth

Publication date: 22 August 2012

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

Full work available at URL: https://semanticscholar.org/paper/8698b85c8b6c6f199d91e313dc3a99190ba34a0e

zbMATH Keywords

crossing numbergeometric graphpolyline drawing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Combinatorial complexity of geometric structures (52C45)

Related Items (5)

An annotated review on graph drawing and its applications ⋮ On the Size of Planarly Connected Crossing Graphs ⋮ A heuristic approach towards drawings of graphs with high crossing resolution ⋮ Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area ⋮ Fan-planarity: properties and complexity

This page was built for publication: Graphs That Admit Polyline Drawings with Few Crossing Angles