outerplanar

• assumed
  • graph class outerplanar is included in graph class planar
  • graph class planar is not included in graph class outerplanar
  • graph class disjoint cycles is included in graph class outerplanar
  • graph class outerplanar is not included in graph class disjoint cycles
• unknown source
  • graph class outerplanar has constant distance to outerplanar – by definition
  • graph class outerplanar has constant bisection bandwidth
• Bodlaender1998
  • page 34 : graph class outerplanar has constant treewidth – Lemma 78. Every outerplanar graph $G=(V,E)$ has treewidth at most 2.
• Diestel2017
  • page 115 : outerplanar – A graph is called outerplanar if it has a drawing in which every vertex lies on the boundary of the outer face.