Chordal bipartite graphs of bounded tree- and clique-width
The treewidth of degree-bounded chordal bipartite graphs is bounded, more precisely, \(\text{ tw}(G) \leq \Delta(G)^2\). Similarly, the cliquewidth of \(k\)-fork-free chordal bipartite graphs is bounded, where a \(k\)-fork is the graph obtained from \(K_{1,k+1}\) by subdividing one edge once. For chordal bipartite graphs in general both parameters are unbounded, see \textit{A. Brandstädt} and \textit{V. V. Lozin} [Ars Comb. 67, 273--281 (2003)].
scientific article; zbMATH DE number 2083728