Planar and Plane Slope Number of Partial 2-Trees
From MaRDI portal
Publication:2867678
DOI10.1007/978-3-319-03841-4_36zbMath1352.05132OpenAlexW285367085MaRDI QIDQ2867678
Debajyoti Mondal, Giuseppe Liotta, Rahnuma Islam Nishat, William J. Lenhart
Publication date: 20 December 2013
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03841-4_36
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
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 ⋮ Planar straight-line realizations of 2-trees with prescribed edge lengths ⋮ Upward planar drawings with two slopes ⋮ Universal slope sets for 1-bend planar drawings ⋮ Drawing subcubic planar graphs with four slopes and optimal angular resolution ⋮ 1-Bend Upward Planar Drawings of SP-Digraphs ⋮ On the Complexity of the Planar Slope Number Problem ⋮ 1-bend upward planar slope number of SP-digraphs ⋮ 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 ⋮ Universal slope sets for upward planar drawings ⋮ Level-planar drawings with few slopes ⋮ Level-planar drawings with few slopes