Drawing subcubic planar graphs with four slopes and optimal angular resolution

DOI10.1016/j.tcs.2017.12.004zbMath1387.68178OpenAlexW2774756933MaRDI QIDQ1694729

Fabrizio Montecchiani, Giuseppe Liotta, Emilio Di Giacomo

Publication date: 6 February 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.12.004

zbMATH Keywords

angular resolutionplanar slope numbersubcubic planar graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) 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 ⋮ Planar drawings with few slopes of Halin graphs and nested pseudotrees ⋮ Upward planar drawings with three and more slopes ⋮ Upward planar drawings with two slopes ⋮ Universal slope sets for 1-bend planar drawings ⋮ Drawing partial 2-trees with few slopes ⋮ Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles ⋮ Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles ⋮ Grid drawings of graphs with constant edge-vertex resolution ⋮ Universal slope sets for upward planar drawings ⋮ Level-planar drawings with few slopes ⋮ Level-planar drawings with few slopes ⋮ Geodesic obstacle representation of graphs

Cites Work

• Unnamed Item
• The planar slope number of planar partial 3-trees of bounded degree
• Geometric representation of cubic graphs with four directions
• A note on finding the bridges of a graph
• Drawing planar graphs using the canonical ordering
• Drawings of planar graphs with few slopes and segments
• Drawing cubic graphs with at most five slopes
• Bounded-degree graphs have arbitrarily large geometric thickness
• Bounded-degree graphs can have arbitrarily large slope numbers
• Graph Drawings with One Bend and Few Slopes
• The Crossing-Angle Resolution in Graph Drawing
• Planar and Plane Slope Number of Partial 2-Trees
• 1-Bend Upward Planar Drawings of SP-Digraphs
• Drawing Graphs in the Plane with High Resolution
• Drawing Cubic Graphs with the Four Basic Slopes
• Cubic graphs have bounded slope parameter
• Drawability of Complete Graphs Using a Minimal Slope Set
• The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
• On-Line Planarity Testing
• The Planar Slope Number of Subcubic Graphs
• Drawing Planar Graphs of Bounded Degree with Few Slopes
• Drawing Outer 1-planar Graphs with Few Slopes

This page was built for publication: Drawing subcubic planar graphs with four slopes and optimal angular resolution