On triangulating \(k\)-outerplanar graphs

DOI10.1016/J.DAM.2014.10.017zbMath1304.05021arXiv1310.1845OpenAlexW2028766875MaRDI QIDQ479051

Therese C. Biedl

Publication date: 5 December 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.1845

zbMATH Keywords

treewidthbranchwidthouter-planaritytriangulated disktriangulating

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (4)

Splitting plane graphs to outerplanarity ⋮ Splitting plane graphs to outerplanarity ⋮ The role of twins in computing planar supports of hypergraphs ⋮ Triangulating Planar Graphs While Keeping the Pathwidth Small

Cites Work

• Unnamed Item
• Graph minors. X: Obstructions to tree-decomposition
• A partial k-arboretum of graphs with bounded treewidth
• 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
• Approximation algorithms for NP-complete problems on planar graphs
• Subgraph Isomorphism in Planar Graphs and Related Problems
• Algorithms - ESA 2003

This page was built for publication: On triangulating \(k\)-outerplanar graphs