A Note on Minimum-Segment Drawings of Planar Graphs
From MaRDI portal
Publication:2838235
DOI10.7155/jgaa.00295zbMath1267.05256MaRDI QIDQ2838235
Debajyoti Mondal, Rahnuma Islam Nishat, Stephane Durocher, S. H. Whitesides
Publication date: 9 July 2013
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00295
05C10: Planar graphs; geometric and topological aspects of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Drawing Planar Graphs with Few Geometric Primitives, Drawing Graphs on Few Circles and Few Spheres, Drawing plane triangulations with few segments, Drawing planar graphs with few segments on a polynomial grid, Variants of the segment number of a graph, Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments