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

DOI10.7155/JGAA.00319MaRDI QIDQ5417596zbMATH OpenOpenAlexFDO

Authors David Eppstein

Publication date 22 May 2014

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

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

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) (n-2) grid.
• How to draw a planar graph on a grid

Cited in

(8)

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

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)