# On triangulating k-outerplanar graphs

arXiv: https://arxiv.org/abs/1310.1845 · HTML: https://mlsanity.com/paper/1310.1845/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 Oct 2013.

## Built on by (most cited first, 1 of 1)

- [From Width-Based Model Checking to Width-Based Automated Theorem Proving](https://mlsanity.com/paper/2205.10995/) (2022)

## Abstract (arXiv)

A k-outerplanar graph is a graph that can be drawn in the plane without crossing such that after k-fold removal of the vertices on the outer-face there are no vertices left. In this paper, we study how to triangulate a k-outerplanar graph while keeping its outerplanarity small. Specifically, we show that not all k-outerplanar graphs can be triangulated so that the result is k-outerplanar, but they can be triangulated so that the result is (k+1)-outerplanar.