Triangulating Planar Graphs While Keeping the Pathwidth Small
From MaRDI portal
Publication:2827827
DOI10.1007/978-3-662-53174-7_30zbMath1417.05036arXiv1505.04235OpenAlexW2258906315MaRDI QIDQ2827827
Publication date: 21 October 2016
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.04235
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On triangulating \(k\)-outerplanar graphs
- 2-connecting outerplanar graphs without blowing up the pathwidth
- How to draw a planar graph on a grid
- Triangulating planar graphs while minimizing the maximum degree
- On triangulating planar graphs under the four-connectivity constraint
- Drawing planar 3-trees with given face areas
- A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs
- PATHWIDTH AND LAYERED DRAWINGS OF TREES
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- On-Line Planarity Testing
- On the Hardness and Approximability of Planar Biconnectivity Augmentation
This page was built for publication: Triangulating Planar Graphs While Keeping the Pathwidth Small
