Recognizing outerplanar graphs in linear time
This paper describes a linear time algorithm to determine whether an arbitrary graph is outerplanar. The algorithm uses an edge coloring technique and deletes successively vertices of degree less than or equal to two. If the degree of a vertex is two, both neighbors of the vertex are joined by an edge. The algorithm works without splitting the graph into its biconnected components or using bucket sort to give the adjacency lists a special order.
Unable to display preview. Download preview PDF.
- [B;78]Brehaupt, W.W., An efficient outerplanarity algorithm, Proc. 8th S.-E. Conf. on Combinatorics, Graph Theory and Computing, Lousiana State University, Feb. 1977.Google Scholar
- [C&H;67]Chartrand, G. and F. Harary, Planar permutation graphs, Ann. Inst. Henri Poincare, Vol. III 4(1967), 433–438.Google Scholar
- [D;53]Dirac, G.A., A property of 4-chromatic graphs, Fund. Math., 40(1953), 42–55.Google Scholar
- [D&S;54]Dirac, G.A. and S. Schuster, A theorem of Kuratowski, Indag. Math., 16(1954), 343–348.Google Scholar
- [S&I;79]Syslo, M.M. and M. Iri, Efficient outerplanarity testing, Annales socientatis mathematica Polanae, Series IV: Fundamenta Informaticae, II(1979), 261–275.Google Scholar
- [V;83]Vo, K.-P., Determining outerplanarity using segment graphs, Linear and Multilinear Algebra, 13(1983), 333–343.Google Scholar