cliquewidthnpc2009
https://www.doi.org/10.1137/070687256
@article{cliquewidthnpc2009,
author = {Michael R. Fellows and Frances A. Rosamond and Udi Rotics and Stefan Szeider},
doi = {10.1137/070687256},
journaltitle = {SIAM Journal on Discrete Mathematics},
number = {2},
pages = {909--939},
title = {Clique-Width is {NP}-Complete},
volume = {23},
year = {2009},
}
- page 8 : pathwidth $k$ upper bounds linear clique-width by $\mathcal O(k)$ – (5) $\mathrm{lin-cwd}(G) \le \mathrm{pwd}(G)+2$.