Drawing partial 2-trees with few slopes
From MaRDI portal
Publication:2701381
DOI10.1007/s00453-022-01065-0OpenAlexW4310276780MaRDI QIDQ2701381
Rahnuma Islam Nishat, William J. Lenhart, Debajyoti Mondal, Giuseppe Liotta
Publication date: 28 April 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-01065-0
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The planar slope number of planar partial 3-trees of bounded degree
- Planar drawings with few slopes of Halin graphs and nested pseudotrees
- Drawing subcubic planar graphs with four slopes and optimal angular resolution
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
- Minimum-segment convex drawings of 3-connected cubic plane graphs
- Drawings of planar graphs with few slopes and segments
- Area requirement of graph drawings with few crossings per edge
- Outerplanar graph drawings with few 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
- Planar and Plane Slope Number of Partial 2-Trees
- Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments
- Drawing Graphs in the Plane with High Resolution
- Drawing Cubic Graphs with the Four Basic Slopes
- Drawability of Complete Graphs Using a Minimal Slope Set
- The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
- Algorithms and Theory of Computation Handbook, Volume 2
- On the Angular Resolution of Planar Graphs
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles
- Graph Drawing
- h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area
- Drawing Planar Graphs of Bounded Degree with Few Slopes
- Drawing Outer 1-planar Graphs with Few Slopes
This page was built for publication: Drawing partial 2-trees with few slopes
