The segment number: algorithms and universal lower bounds for some classes of planar graphs

DOI10.1007/978-3-031-15914-5_20arXiv2202.11604MaRDI QIDQ6039428

Ina Goeßmann, Myroslav Kryven, Johannes Zink, Alexander Wolff, Felix Klesen, Stephen G. Kobourov, Jonathan Klawitter, Boris Klemz

Publication date: 5 May 2023

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.11604

zbMATH Keywords

lower/upper boundsvisual complexitysegment number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Convex drawings of graphs with non-convex boundary constraints
• Convex drawings of hierarchical planar graphs and clustered planar graphs
• Drawing plane triangulations with few segments
• Drawing planar graphs with few segments on a polynomial grid
• Variants of the segment number of a graph
• Minimum-segment convex drawings of 3-connected cubic plane graphs
• Drawings of planar graphs with few slopes and segments
• The complexity of drawing graphs on few lines and few planes
• Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments
• Convex Representations of Graphs
• Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
• Generating all 3‐connected 4‐regular planar graphs from the octahedron graph
• Drawing Planar Graphs with Few Geometric Primitives
• Experimental Analysis of the Accessibility of Drawings with Few Segments
• Drawing Graphs on Few Circles and Few Spheres
• Drawing graphs on few lines and few planes
• Drawing Graphs with Few Arcs
• Convexity-increasing morphs of planar graphs
• Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing

This page was built for publication: The segment number: algorithms and universal lower bounds for some classes of planar graphs