Gurski2005

https://www.doi.org/10.1016/j.tcs.2005.05.018

@article{Gurski2005,
author = {Frank Gurski and Egon Wanke},
doi = {10.1016/j.tcs.2005.05.018},
issn = {0304-3975},
journaltitle = {Theoretical Computer Science},
number = {1},
pages = {76--89},
title = {On the relationship between NLC-width and linear NLC-width},
volume = {347},
year = {2005},
}

• page 4 : linear NLC-width – Definition 3
• page 4 : clique-tree-width – Definition 5
• page 5 : linear clique-width – Definition 6
• page 8 : linear NLC-width $k$ upper bounds NLCT-width by $\mathcal O(k)$
• page 8 : NLCT-width $k$ upper bounds NLC-width by $\mathcal O(k)$
• page 8 : linear clique-width $k$ upper bounds clique-tree-width by $\mathcal O(k)$
• page 8 : clique-tree-width $k$ upper bounds clique-width by $\mathcal O(k)$
• page 8 : clique-tree-width $k$ upper bounds NLCT-width by $\mathcal O(k)$
• page 8 : NLCT-width $k$ upper bounds clique-tree-width by $\mathcal O(k)$
• page 8 : pathwidth $k$ upper bounds linear NLC-width by $f(k)$ – The results of [23] imply that each graph class of bounded path-width has bounded linear NLC-width and that each graph class of bounded tree-width has bounded NLCT-width.
• page 8 : treewidth $k$ upper bounds NLCT-width by $f(k)$ – The results of [23] imply that each graph class of bounded path-width has bounded linear NLC-width and that each graph class of bounded tree-width has bounded NLCT-width.