Cubic Planar Graphs that cannot be Drawn on few Lines
From MaRDI portal
Publication:5088962
DOI10.4230/LIPIcs.SoCG.2019.32OpenAlexW2964163609MaRDI QIDQ5088962
Publication date: 18 July 2022
Full work available at URL: https://doi.org/10.4230/LIPIcs.SoCG.2019.32
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the parameterized complexity of layered graph drawing
- Edge crossings in drawings of bipartite graphs
- Drawing graphs in two layers
- Track layouts, layered path decompositions, and leveled planarity
- A data structure for dynamic trees
- Line and plane cover numbers revisited
- The complexity of drawing graphs on few lines and few planes
- A structural characterization of planar combinatorial graphs
- Drawing Graphs on Few Lines and Few Planes
- Combinatorics and Geometry of Finite and Infinite Squaregraphs
- On Collinear Sets in Straight-Line Drawings
- Forbidden Configurations in Discrete Geometry
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- Minor-Closed Graph Classes with Bounded Layered Pathwidth
- A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
This page was built for publication: Cubic Planar Graphs that cannot be Drawn on few Lines
