Drawing Graphs on Few Lines and Few Planes

DOI10.1007/978-3-319-50106-2_14zbMath1457.68206arXiv1607.01196OpenAlexW2963720330MaRDI QIDQ2961513

Fabian Lipp, Steven Chaplick, Alexander Wolff, Oleg Verbitsky, Krzysztof Fleszar, O. V. Ravskyj

Publication date: 21 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items

Hypergraph representation via axis-aligned point-subspace cover ⋮ Drawing Planar Graphs with Few Geometric Primitives ⋮ 4-connected triangulations on few lines ⋮ Line and plane cover numbers revisited ⋮ Drawing planar graphs with few segments on a polynomial grid ⋮ Variants of the segment number of a graph ⋮ Cubic Planar Graphs that cannot be Drawn on few Lines ⋮ Aligned Drawings of Planar Graphs ⋮ Drawing Graphs on Few Circles and Few Spheres ⋮ Towards a Characterization of Stretchable Aligned Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph layouts via layered separators
• How to draw a planar graph on a grid
• On point-linear arboricity of planar graphs
• Drawing plane triangulations with few segments
• Optimizing area and aspect ratio in straight-line orthogonal tree drawings
• Parallel complexity of partitioning a planar graph into vertex-induced forests
• Drawings of planar graphs with few slopes and segments
• The complexity of drawing graphs on few lines and few planes
• On the vertex-arboricity of planar graphs
• Shortness exponents of families of graphs
• On Collinear Sets in Straight-Line Drawings
• The Existence and Construction of Balanced Incomplete Block Designs
• On the linear vertex-arboricity of a planar graph
• Bounds for the vertex linear arboricity
• Path chromatic numbers of graphs
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
• Layout of Graphs with Bounded Tree-Width
• On the Queue Number of Planar Graphs
• The Point-Arboricity of Planar Graphs
• COVERING AND PACKING IN GRAPHS, I.
• On extreme points of regular convex sets
• Drawing Graphs with Few Arcs
• Acyclic colorings of planar graphs