distance to cograph

• 2019 Sorge2019
  • page 9 : distance to cograph $k$ upper bounds clique-width by $2^{\mathcal O(k)}$ – Lemma 4.17. The distance $c$ to a cograph upper bounds the cliquewidth $q$. We have $q \le 2^{3+c}-1$.
• unknown
  • cograph upper bounds distance to cograph by a constant – by definition
  • distance to cograph $k$ upper bounds clique-width by $f(k)$
  • distance to cograph $k$ upper bounds chordality by $f(k)$
  • distance to cograph $k$ upper bounds diameter by $f(k)$