Monotone drawings of \(k\)-inner planar graphs
From MaRDI portal
Publication:1725768
DOI10.1007/978-3-030-04414-5_24OpenAlexW2888553789MaRDI QIDQ1725768
Antonios Symvonis, Anargyros Oikonomou
Publication date: 15 February 2019
Full work available at URL: https://arxiv.org/abs/1808.06892
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Unnamed Item
- Nearly optimal monotone drawing of trees
- Good spanning trees in graph drawing
- Monotone drawings of \(k\)-inner planar graphs
- Monotone drawings of graphs with fixed embedding
- On Monotone Drawings of Trees
- Compact Monotone Drawing of Trees
- Monotone Drawings of 3-Connected Plane Graphs
- Simple Compact Monotone Tree Drawings
- Orderly Spanning Trees with Applications
- Optimal Monotone Drawings of Trees
- Monotone Drawings of Graphs
- Convex drawings of planar graphs and the order dimension of 3-polytopes
This page was built for publication: Monotone drawings of \(k\)-inner planar graphs