Elsevier

Information Processing Letters

Volume 9, Issue 5, 16 December 1979, Pages 229-232
Information Processing Letters

Linear algorithms to recognize outerplanar and maximal outerplanar graphs

https://doi.org/10.1016/0020-0190(79)90075-9Get rights and content

First page preview

First page preview
Click to open first page preview

References (5)

  • W. Brehaut, An efficient outerplanarity algorithm, in : Proc. Eighth Southeastern Conf. on Combinatories, Graph Theory...
  • F. Gavril

    An algorithm for testing chordality of graphs

    Information Processing Lett.

    (1974)
There are more references available in the full text version of this article.

Cited by (112)

  • Uniquely colorable graphs up to automorphisms

    2023, Applied Mathematics and Computation
  • The Distance Orientation Problem

    2022, Discrete Applied Mathematics
  • Planar rectilinear drawings of outerplanar graphs in linear time

    2022, Computational Geometry: Theory and Applications
View all citing articles on Scopus
View full text