Drawing Graphs with Few Arcs

DOI10.7155/jgaa.00366zbMath1323.05094OpenAlexW2404730450MaRDI QIDQ5895223

André Schulz

Publication date: 29 October 2015

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00366

zbMATH Keywords

composite arc-drawingcomposite segment-drawing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (13)

Upward Planar Drawings with Three and More Slopes ⋮ Drawing plane triangulations with few segments ⋮ Upward planar drawings with two slopes ⋮ Drawing Planar Graphs with Few Geometric Primitives ⋮ 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 ⋮ Angles of arc-polygons and lombardi drawings of cacti ⋮ Drawing Graphs on Few Lines and Few Planes ⋮ Line and plane cover numbers revisited ⋮ Drawing planar graphs with few segments on a polynomial grid ⋮ Variants of the segment number of a graph ⋮ Experimental Analysis of the Accessibility of Drawings with Few Segments ⋮ Drawing Graphs on Few Circles and Few Spheres

This page was built for publication: Drawing Graphs with Few Arcs