Outerplanar graph

History

Outerplanar graphs were first studied and named by , in connection with the problem of determining the planarity of graphs formed by using a perfect matching to connect two copies of a base graph (for instance, many of the generalized Petersen graphs are formed in this way from two copies of a cycle graph). As they showed, when the base graph is biconnected, a graph constructed in this way is planar if and only if its base graph is outerplanar and the matching forms a dihedral permutation of its outer cycle. Chartrand and Harary also proved an analogue of Kuratowski's theorem for outerplanar graphs, that a graph is outerplanar if and only if it does not contain a subdivision of one of the two graphs K4 or K2,3.

Definition and characterizations

An outerplanar graph is an undirected graph that can be drawn in the plane without crossings in such a way that all of the vertices belong to the unbounded face of the drawing. That is, no vertex is totally surrounded by edges. Alternatively, a graph G is outerplanar if the graph formed from G by adding a new vertex, with edges connecting it to all the other vertices, is a planar graph.

A maximal outerplanar graph is an outerplanar graph that cannot have any additional edges added to it while preserving outerplanarity. Every maximal outerplanar graph with n vertices has exactly 2n − 3 edges, and every bounded face of a maximal outerplanar graph is a triangle.

Forbidden graphs

Outerplanar graphs have a forbidden graph characterization analogous to Kuratowski's theorem and Wagner's theorem for planar graphs: a graph is outerplanar if and only if it does not contain a subdivision of the complete graph K4 or the complete bipartite graph K2,3. Alternatively, a graph is outerplanar if and only if it does not contain K4 or K2,3 as a minor, a graph obtained from it by deleting and contracting edges.

A triangle-free graph is outerplanar if and only if it does not contain a subdivision of K2,3.

Colin de Verdière invariant

A graph is outerplanar if and only if its Colin de Verdière graph invariant is at most two. The graphs characterized in a similar way by having Colin de Verdière invariant at most one, three, or four are respectively the linear forests, planar graphs, and linklessly embeddable graphs.

Properties

Biconnectivity and Hamiltonicity

An outerplanar graph is biconnected if and only if the outer face of the graph forms a simple cycle without repeated vertices. An outerplanar graph is Hamiltonian if and only if it is biconnected; in this case, the outer face forms the unique Hamiltonian cycle. More generally, the size of the longest cycle in an outerplanar graph is the same as the number of vertices in its largest biconnected component. For this reason finding Hamiltonian cycles and longest cycles in outerplanar graphs may be solved in linear time, in contrast to the NP-completeness of these problems for arbitrary graphs.

Every maximal outerplanar graph satisfies a stronger condition than Hamiltonicity: it is node pancyclic, meaning that for every vertex v and every k in the range from three to the number of vertices in the graph, there is a length-k cycle containing v. A cycle of this length may be found by repeatedly removing a triangle that is connected to the rest of the graph by a single edge, such that the removed vertex is not v, until the outer face of the remaining graph has length k.

A planar graph is outerplanar if and only if each of its biconnected components is outerplanar.

Coloring

All loopless outerplanar graphs can be colored using only three colors; this fact features prominently in the simplified proof of Chvátal's art gallery theorem by . A 3-coloring may be found in linear time by a greedy coloring algorithm that removes any vertex of degree at most two, colors the remaining graph recursively, and then adds back the removed vertex with a color different from the colors of its two neighbors.

According to Vizing's theorem, the chromatic index of any graph (the minimum number of colors needed to color its edges so that no two adjacent edges have the same color) is either the maximum degree of any vertex of the graph or one plus the maximum degree. However, in a connected outerplanar graph, the chromatic index is equal to the maximum degree except when the graph forms a cycle of odd length. An edge coloring with an optimal number of colors can be found in linear time based on a breadth-first traversal of the weak dual tree.

Other properties

Outerplanar graphs have degeneracy at most two: every subgraph of an outerplanar graph contains a vertex with degree at most two.

Outerplanar graphs have treewidth at most two, which implies that many graph optimization problems that are NP-complete for arbitrary graphs may be solved in polynomial time by dynamic programming when the input is outerplanar. More generally, k-outerplanar graphs have treewidth O(k).

Every outerplanar graph can be represented as an intersection graph of axis-aligned rectangles in the plane, so outerplanar graphs have boxicity at most two.

Related families of graphs

Every outerplanar graph is a planar graph. Every outerplanar graph is also a subgraph of a series–parallel graph. However, not all planar series–parallel graphs are outerplanar. The complete bipartite graph K2,3 is planar and series–parallel but not outerplanar. On the other hand, the complete graph K4 is planar but neither series–parallel nor outerplanar. Every forest and every cactus graph are outerplanar.

The weak planar dual graph of an embedded outerplanar graph (the graph that has a vertex for every bounded face of the embedding, and an edge for every pair of adjacent bounded faces) is a forest, and the weak planar dual of a Halin graph is an outerplanar graph. A planar graph is outerplanar if and only if its weak dual is a forest, and it is Halin if and only if its weak dual is biconnected and outerplanar.

There is a notion of degree of outerplanarity. A 1-outerplanar embedding of a graph is the same as an outerplanar embedding. For k 1 a planar embedding is said to be k-outerplanar if removing the vertices on the outer face results in a (k − 1)-outerplanar embedding. A graph is k-outerplanar if it has a k-outerplanar embedding.

An outer-1-planar graph, analogously to 1-planar graphs can be drawn in a disk, with the vertices on the boundary of the disk, and with at most one crossing per edge.

Every maximal outerplanar graph is a chordal graph. Every maximal outerplanar graph is the visibility graph of a simple polygon. Maximal outerplanar graphs are also formed as the graphs of polygon triangulations. They are examples of 2-trees, of series–parallel graphs, and of chordal graphs.

Every outerplanar graph is a circle graph, the intersection graph of a set of chords of a circle.

Notes

References

• {{citation
• {{citation
• {{citation
• {{citation
• {{citation
• {{citation | author1-link = Andreas Brandstädt | url-access = registration
• {{citation | author2-link = Frank Harary
• {{citation
• {{citation
• {{citation
• {{citation
• {{citation | doi-access =
• {{citation
• {{citation
• {{citation
• {{citation | doi-access = free
• {{citation
• {{citation
• {{citation
• {{citation
• {{citation
• {{citation
• {{citation | editor-last = Sachs | editor-first = Horst | editor-link = Horst Sachs
• {{citation

References

1. {{harvtxt. Wiegers. 1986
2. {{harvtxt. Felsner. 2004.
3. {{harvtxt. Chartrand. Harary. 1967; {{harvtxt. Sysło. 1979; {{harvtxt. Brandstädt. Le. Spinrad. 1999, Proposition 7.3.1, p. 117; {{harvtxt. Felsner. 2004.
4. {{harvtxt. Diestel. 2000.
5. {{harvtxt. Chartrand. Harary. 1967; {{harvtxt. Sysło. 1979.
6. {{harvtxt. Li. Corneil. Mendelsohn. 2000, Proposition 2.5.
7. {{harvtxt. Sysło. 1979.
8. {{harvtxt. Proskurowski. Sysło. 1986.
9. {{harvtxt. Fiorini. 1975.
10. {{harvtxt. Lick. White. 1970.
11. {{harvtxt. Baker. 1994.
12. {{harvtxt. Scheinerman. 1984; {{harvtxt. Brandstädt. Le. Spinrad. 1999, p. 54.
13. {{harvtxt. Brandstädt. Le. Spinrad. 1999, p. 174.
14. {{harvtxt. Brandstädt. Le. Spinrad. 1999, p. 169.
15. {{harvtxt. Sysło. Proskurowski. 1983.
16. {{harvtxt. Kane. Basu. 1976; {{harvtxt. Sysło. 1979.
17. {{harvtxt. El-Gindy. 1985; {{harvtxt. Lin. Skiena. 1995; {{harvtxt. Brandstädt. Le. Spinrad. 1999, Theorem 4.10.3, p. 65.
18. {{harvtxt. Wessel. Pöschel. 1985; {{harvtxt. Unger. 1988.