Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
From MaRDI portal
Recommendations
Cites work
- Bemerkungen zum Vierfarbenproblem
- Convex Maps
- Drawings of planar graphs with few slopes and segments
- Graph Drawing
- How to draw a planar graph on a grid
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 2123122 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
Cited in
(7)- Drawing plane triangulations with few segments
- Variants of the segment number of a graph
- Minimum-segment convex drawings of 3-connected cubic plane graphs
- A note on minimum-segment drawings of planar graphs
- Graph Drawing
- The segment number: algorithms and universal lower bounds for some classes of planar graphs
- The parametrized complexity of the segment number
This page was built for publication: Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611877)