linear clique-width
- 2019/01 Ganian2019
- shrub-depth $k$ upper bounds linear clique-width by $\mathcal O(k)$ – Proposition 3.4. Let $\mathcal G$ be a graph class and $d$ an integer. Then: … b) If $\mathcal G$ is of bounded shrub-depth, then $\mathcal G$ is of bounded linear clique-width.
- unknown
- linear clique-width $k$ upper bounds clique width by $f(k)$