A note on minimum-segment drawings of planar graphs
From MaRDI portal
Recommendations
- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
- Minimum-segment convex drawings of 3-connected cubic plane graphs (extended abstract)
- Minimum-segment convex drawings of 3-connected cubic plane graphs
- Drawings of planar graphs with few slopes and segments
- Drawing planar graphs with few geometric primitives
Cited in
(14)- Drawing plane triangulations with few segments
- Drawing planar graphs with few segments on a polynomial grid
- Variants of the segment number of a graph
- Drawing planar cubic 3-connected graphs with few segments: algorithms \& experiments
- On Representation of Planar Graphs by Segments
- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
- Drawing planar graphs with few geometric primitives
- Drawing graphs on few circles and few spheres
- On Area-Optimal Planar Graph Drawings
- On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs
- Graph Drawing
- Drawing graphs as spanners
- The Complexity of Drawing Graphs on Few Lines and Few Planes
- The parametrized complexity of the segment number
This page was built for publication: A note on minimum-segment drawings of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2838235)