Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs

@article{Hedetniemi1979LinearAT,
  title={Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs},
  author={Sandra Mitchell Hedetniemi},
  journal={Inf. Process. Lett.},
  year={1979},
  volume={9},
  pages={229-232}
}
One of the more important and often difficult problems in graph theoretic computing is that of recognizing whether an arbitrary graph is a member of a given class of graphs. This problem has already been solved for several interesting classes of graphs, including planar graphs by Hopcroft and Tarjan [4], line graphs by Roussoupolous [5], chordal graphs by Gavril [2] and outerplanar graphs by Brehaut [ 11. Hopcroft and Tarjan’s planar recognition algorit’kun executes in time linear in the number… CONTINUE READING