Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
From MaRDI portal
Publication:2849802
Cited in
(14)- Small area drawings of outerplanar graphs
- Horton-Strahler number, rooted pathwidth and upward drawings of trees
- Tree drawings revisited
- Strictly-convex drawings of 3-connected planar graphs
- Ideal drawings of rooted trees with approximately optimal width
- On the area requirements of planar straight-line orthogonal drawings of ternary trees
- Bitonic \(st\)-orderings for upward planar graphs
- Improved Upper and Lower Bounds for LR Drawings of Binary Trees
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree
- Schnyder woods, \(\mathrm{SLE}_{16}\), and Liouville quantum gravity
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Approximation Algorithms for Facial Cycles in Planar Embeddings
- On upward drawings of trees on a given grid
This page was built for publication: Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849802)