Drawing arrangement graphs in small grids, or how to play Planarity

DOI10.7155/JGAA.00319zbMATH Open1288.05267OpenAlexW2056925460MaRDI QIDQ5417596FDOQ5417596

Authors: David Eppstein 

Publication date: 22 May 2014

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00319

Recommendations

• Drawing arrangement graphs in small grids, or how to play planarity
• scientific article; zbMATH DE number 1990911
• A linear-time algorithm for drawing a planar graph on a grid
• A linear-time algorithm for drawing a planar graph on an \((n-2)\times (n-2)\) grid.
• How to draw a planar graph on a grid

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (8)

• Drawing arrangement graphs in small grids, or how to play planarity
• Arrangements of approaching pseudo-lines
• What Can You Draw?
• Geometry and generation of a new graph planarity game
• The Complexity of Drawing Graphs on Few Lines and Few Planes
• A characterization of planar graphs by pseudo-line arrangements
• Removing popular faces in curve arrangements
• Variants of the segment number of a graph

This page was built for publication: Drawing arrangement graphs in small grids, or how to play Planarity

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