courcelle2000

https://www.doi.org/10.1016/S0166-218X(99)00184-5

@article{courcelle2000,
author = {Courcelle, Bruno and Olariu, Stephan},
doi = {10.1016/S0166-218X(99)00184-5},
issn = {0166-218X},
journaltitle = {Discrete Applied Mathematics},
keywords = {Algorithms, Hierarchical graph decompositions, Modular decomposition, Monadic second-order logic, Tree decompositions},
number = {1},
pages = {77--114},
title = {Upper bounds to the clique width of graphs},
volume = {101},
year = {2000},
}

page 18 : treewidth $k$ upper bounds clique-width by $2^{\mathcal O(k)}$ – We will prove that for every undirected graph $G$, $cwd(G) \le 2^{twd(G)+1}+1$ …