k-outerplanar graph
In graph theory, a k-outerplanar graph is a planar graph that has a planar embedding in which the vertices belong to at most [math]\displaystyle{ k }[/math] concentric layers. The outerplanarity index of a planar graph is the minimum value of [math]\displaystyle{ k }[/math] for which it is [math]\displaystyle{ k }[/math]-outerplanar.
Definition
An outerplanar graph (or 1-outerplanar graph) has all of its vertices on the unbounded (outside) face of the graph. A 2-outerplanar graph is a planar graph with the property that, when the vertices on the unbounded face are removed, the remaining vertices all lie on the newly formed unbounded face. And so on.
More formally, a graph is [math]\displaystyle{ k }[/math]-outerplanar if it has a planar embedding such that, for every vertex, there is an alternating sequence of at most [math]\displaystyle{ k }[/math] faces and [math]\displaystyle{ k }[/math] vertices of the embedding, starting with the unbounded face and ending with the vertex, in which each consecutive face and vertex are incident to each other.
Properties and applications
The [math]\displaystyle{ k }[/math]-outerplanar graphs have treewidth at most [math]\displaystyle{ 3k-1 }[/math].[1] However, some bounded-treewidth planar graphs such as the nested triangles graph may be [math]\displaystyle{ k }[/math]-outerplanar only for very large [math]\displaystyle{ k }[/math], linear in the number of vertices.
Baker's technique covers a planar graph with a constant number of [math]\displaystyle{ k }[/math]-outerplanar graphs and uses their low treewidth in order to quickly approximate several hard graph optimization problems.[2]
In connection with the GNRS conjecture on metric embedding of minor-closed graph families, the [math]\displaystyle{ k }[/math]-outerplanar graphs are one of the most general classes of graphs for which the conjecture has been proved.[3]
A conjectured converse of Courcelle's theorem, according to which every graph property recognizable on graphs of bounded treewidth by finite state tree automata is definable in the monadic second-order logic of graphs, has been proven for the [math]\displaystyle{ k }[/math]-outerplanar graphs.[4]
Recognition
The smallest value of [math]\displaystyle{ k }[/math] for which a given graph is [math]\displaystyle{ k }[/math]-outerplanar (its outerplanarity index) can be computed in quadratic time.[5]
References
- ↑ "A partial [math]\displaystyle{ k }[/math]-arboretum of graphs with bounded treewidth", Theoretical Computer Science 209 (1–2): 1–45, 1998, doi:10.1016/S0304-3975(97)00228-4
- ↑ "Approximation algorithms for NP-complete problems on planar graphs", Journal of the ACM 41 (1): 153–180, 1994, doi:10.1145/174644.174650.
- ↑ Chekuri, Chandra; Gupta, Anupam; Newman, Ilan; Rabinovich, Yuri (2006), "Embedding [math]\displaystyle{ k }[/math]-outerplanar graphs into [math]\displaystyle{ \ell_1 }[/math]", SIAM Journal on Discrete Mathematics 20 (1): 119–136, doi:10.1137/S0895480102417379
- ↑ Jaffke, Lars (2017), "Definability equals recognizability for [math]\displaystyle{ k }[/math]-outerplanar graphs and [math]\displaystyle{ \ell }[/math]-chordal partial [math]\displaystyle{ k }[/math]-trees", European Journal of Combinatorics 66: 191–234, doi:10.1016/j.ejc.2017.06.025, https://research.tue.nl/nl/publications/definability-equals-recognizability-for-kouterplanar-graphs-and-lchordal-partial-ktrees(775c0b9a-5f58-45c4-8fab-71d00b95a7c3).html
- ↑ Kammer, Frank (2007), "Determining the smallest [math]\displaystyle{ k }[/math] such that [math]\displaystyle{ G }[/math] is [math]\displaystyle{ k }[/math]-outerplanar", in Arge, Lars; Hoffmann, Michael; Welzl, Emo, Algorithms: ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, Lecture Notes in Computer Science, 4698, Springer, pp. 359–370, doi:10.1007/978-3-540-75520-3_33
 |  |
