Linear algorithms to recognize outerplanar and maximal outerplanar graphs
References (5)
- W. Brehaut, An efficient outerplanarity algorithm, in : Proc. Eighth Southeastern Conf. on Combinatories, Graph Theory...
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)
An improved algorithm for finding maximum outerplanar subgraphs
2024, Discrete Applied MathematicsUniquely colorable graphs up to automorphisms
2023, Applied Mathematics and ComputationA linear-time certifying algorithm for recognizing generalized series–parallel graphs
2023, Discrete Applied MathematicsTesting the planar straight-line realizability of 2-trees with prescribed edge lengths
2023, European Journal of CombinatoricsThe Distance Orientation Problem
2022, Discrete Applied MathematicsPlanar rectilinear drawings of outerplanar graphs in linear time
2022, Computational Geometry: Theory and Applications
Copyright © 1979 Published by Elsevier B.V.