A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Characterizations of outerplanar graphs
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
doi:10.1016/0012-365x(79)90060-8
fatcat:2wb7tontlbeqrkea4mdjpca5um