linear clique-width

• unknown source
  • linear clique-width upper bounds clique-width by a computable function
• Gurski2005
  • page 5 : linear clique-width – Definition 6
  • page 8 : linear clique-width upper bounds clique-tree-width by a linear function
• Johansson1998
  • linear clique-width upper bounds linear NLC-width by a linear function
  • linear NLC-width upper bounds linear clique-width by a linear function
• Ganian2019
  • shrub-depth upper bounds linear clique-width by a linear function – 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.
• Adler2015
  • page 1 : linear rank-width upper bounds linear clique-width by a computable function – Linear rank-width is equivalent to linear clique-width in the sense that any graph class has bounded linear clique-width if and only if it has bounded linear rank-width.
  • page 1 : linear clique-width upper bounds linear rank-width by a computable function – Linear rank-width is equivalent to linear clique-width in the sense that any graph class has bounded linear clique-width if and only if it has bounded linear rank-width.
• cliquewidthnpc2009
  • page 8 : pathwidth upper bounds linear clique-width by a linear function – (5) $\mathrm{lin-cwd}(G) \le \mathrm{pwd}(G)+2$.