Variants of the segment number of a graph

DOI10.1007/978-3-030-35802-0_33OpenAlexW2990967247MaRDI QIDQ2206875

Alexander Wolff, Yoshio Okamoto, O. V. Ravskyj

Publication date: 26 October 2020

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

The Complexity of Drawing a Graph in a Polygonal Region ⋮ The segment number: algorithms and universal lower bounds for some classes of planar graphs ⋮ The Complexity of Drawing Graphs on Few Lines and Few Planes

Cites Work

• Unnamed Item
• Geometric representation of cubic graphs with four directions
• Computing an st-numbering
• At most single-bend embeddings of cubic graphs
• Drawing planar graphs with few geometric primitives
• Drawing planar graphs with few segments on a polynomial grid
• 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
• A Note on Minimum-Segment Drawings of Planar Graphs
• Drawing Graphs on Few Lines and Few Planes
• On the Complexity of the Planar Slope Number Problem
• Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments
• Complexity of Some Geometric and Topological Problems
• PROPERTIES OF ARRANGEMENT GRAPHS
• Chromatic Graph Theory
• Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity
• Drawing Graphs with Few Arcs