distance to outerplanar

• unknown source
  • graph class outerplanar has constant distance to outerplanar – by definition
  • distance to outerplanar upper bounds treewidth by a linear function – After removal of $k$ vertices the remaining class has a bounded width $w$. So by including the removed vertices in every bag, we can achieve decomposition of width $w+k$
• SchroderThesis
  • page 26 : bounded distance to outerplanar does not imply bounded distance to perfect – Proposition 3.23