Characterizations of outerplanar graphs

Maciej M. Sysło
1979 Discrete Mathematics  
The paper presents several characterizations of outerp:anar graphs, some of them are counterparts of the well-known characterizations of planar graphs and the other provide very efficient tools for outerplanarity testing, coding (i.e. isomorphism testing), and counting such graphs. Finally, we attempt to generalize these results for k-outerplanar graphs. MTOdUCtiOll The main purpose of this paper is to provide some further characterizations of outerplanar graphs. A graph G = (V, E) consists of
more » ... set V of n vertices and a set E of m edges. Only simple graphs, i.e. without loops and multiple edges are considered in this paper.
doi:10.1016/0012-365x(79)90060-8 fatcat:2wb7tontlbeqrkea4mdjpca5um