Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
From MaRDI portal
Publication:5144877
Recommendations
Cites work
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
- A better heuristic for orthogonal graph drawings
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
- Algorithms for plane representations of acyclic digraphs
- An annotated bibliography on 1-planarity
- Bounded-degree graphs can have arbitrarily large slope numbers
- Bounded-degree graphs have arbitrarily large geometric thickness
- Drawing Cubic Graphs with the Four Basic Slopes
- Drawing Graphs in the Plane with High Resolution
- Drawing outer 1-planar graphs with few slopes
- Drawing planar graphs using the canonical ordering
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
- Drawing subcubic planar graphs with four slopes and optimal angular resolution
- Drawings of planar graphs with few slopes and segments
- Ein Sechsfarbenproblem auf der Kugel
- Embedding-preserving rectangle visibility representations of nonplanar graphs
- Fáry's theorem for 1-planar graphs
- Guest Editors' Foreword and Overview
- scientific article; zbMATH DE number 512936 (Why is no real title available?)
- Introduction to algorithms.
- On the Angular Resolution of Planar Graphs
- On the density of maximal 1-planar graphs
- Outerplanar graph drawings with few slopes
- Planar and plane slope number of partial 2-trees
- Planar octilinear drawings with one bend per edge
- Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution
- Right angle crossing graphs and 1-planarity
- Straight-line grid drawings of 3-connected 1-planar graphs
- The planar slope number of planar partial 3-trees of bounded degree
- The structure of 1-planar graphs
- Universal slope sets for 1-bend planar drawings
Cited in
(7)- Drawing subcubic planar graphs with four slopes and optimal angular resolution
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
- Quasi-upward planar drawings with minimum curve complexity
- Drawing partial 2-trees with few slopes
- Planar Lombardi Drawings for Subcubic Graphs
- The stub resolution of 1-planar graphs
- Planar drawings with few slopes of Halin graphs and nested pseudotrees
This page was built for publication: Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144877)
