Drawing outer-1-planar graphs revisited
From MaRDI portal
Publication:5084704
Recommendations
Cites work
- An annotated bibliography on 1-planarity
- Every outer-1-plane graph has a right angle crossing drawing
- Fáry's theorem for 1-planar graphs
- Height-preserving transformations of planar graph drawings
- scientific article; zbMATH DE number 3924797 (Why is no real title available?)
- scientific article; zbMATH DE number 1974107 (Why is no real title available?)
- Optimal-area visibility representations of outer-1-plane graphs
- Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity
- Outer 1-planar graphs
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
Cited in
(9)- Small area drawings of outerplanar graphs
- Degenerate drawing of outerplanar graphs with two edge lengths
- Optimal-area visibility representations of outer-1-plane graphs
- Drawing planar graphs symmetrically. III: Oneconnected planar graphs
- Correction to: ``Outer 1-planar graphs
- Computing and Combinatorics
- Drawing outerplanar graphs using three edge lengths
- Drawing outer-1-planar graphs revisited
- Optimal-area visibility representations of outer-1-plane graphs
This page was built for publication: Drawing outer-1-planar graphs revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084704)