Outerplanar graph drawings with few slopes
From MaRDI portal
Publication:2444313
DOI10.1016/j.comgeo.2014.01.003zbMath1296.05056arXiv1205.2548OpenAlexW3103644630MaRDI QIDQ2444313
Kolja Knauer, Bartosz Walczak, Piotr Micek
Publication date: 9 April 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.2548
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) 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 ⋮ Upward planar drawings with two slopes ⋮ Universal slope sets for 1-bend planar drawings ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- The planar slope number of planar partial 3-trees of bounded degree
- Geometric representation of cubic graphs with four directions
- Graph drawings with few slopes
- 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
- Bemerkungen zum Vierfarbenproblem
- Drawing Cubic Graphs with the Four Basic Slopes
- Drawability of Complete Graphs Using a Minimal Slope Set
- Drawing Planar Graphs of Bounded Degree with Few Slopes
