NLCT-width

• Gurski2005
  • page 8 : linear NLC-width upper bounds NLCT-width by a linear function
  • page 8 : NLCT-width upper bounds NLC-width by a linear function
  • page 8 : clique-tree-width upper bounds NLCT-width by a linear function
  • page 8 : NLCT-width upper bounds clique-tree-width by a linear function
  • page 8 : treewidth upper bounds NLCT-width by a computable function – 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.
• Wanke1994
  • page 4 : NLCT-width – Definition 2.2. Let $k \in \mathbb N$ be a positive integer. A \emph{$k$-node label controlled (NLC) tree} is a $k$-NL graph defined as follows: …