The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs
- 1 October 2022
- book chapter
- Published by Springer Nature
- p. 271-286
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- The Complexity of Drawing Graphs on Few Lines and Few Planes2017
- Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & ExperimentsJournal of Graph Algorithms and Applications, 2017
- Drawing Graphs with Few ArcsJournal of Graph Algorithms and Applications, 2015
- Minimum-segment convex drawings of 3-connected cubic plane graphsJournal of Combinatorial Optimization, 2011
- Convex drawings of hierarchical planar graphs and clustered planar graphsJournal of Discrete Algorithms, 2010
- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree ThreeLecture Notes in Computer Science, 2009
- Convex drawings of graphs with non-convex boundary constraintsDiscrete Applied Mathematics, 2008
- Drawings of planar graphs with few slopes and segmentsComputational Geometry, 2007
- Generating all 3‐connected 4‐regular planar graphs from the octahedron graphJournal of Graph Theory, 1993
- Convex Representations of GraphsProceedings of the London Mathematical Society, 1960