Chapter

Graph Drawing

Volume 8242 of the series Lecture Notes in Computer Science pp 107-118

Recognizing Outer 1-Planar Graphs in Linear Time

  • Christopher AuerAffiliated withUniversity of Passau
  • , Christian BachmaierAffiliated withUniversity of Passau
  • , Franz J. BrandenburgAffiliated withUniversity of Passau
  • , Andreas GleißnerAffiliated withUniversity of Passau
  • , Kathrin HanauerAffiliated withUniversity of Passau
  • , Daniel NeuwirthAffiliated withUniversity of Passau
  • , Josef ReislhuberAffiliated withUniversity of Passau

Abstract

A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are on the outer face and each edge is crossed at most once. o1p graphs generalize outerplanar graphs, which can be recognized in linear time and specialize 1-planar graphs, whose recognition is \(\mathcal{NP}\)-hard.

Our main result is a linear-time algorithm that first tests whether a graph G is o1p, and then computes an embedding. Moreover, the algorithm can augment G to a maximal o1p graph. If G is not o1p, then it includes one of six minors (see Fig. 3), which are also detected by the recognition algorithm. Hence, the algorithm returns a positive or negative witness for o1p.