2 problems

Bonnet–Duron's conjecture. Every class of graphs with bounded stretch-width has clique-width at most logarithmic in the number of vertices; equivalently, there is a constant $c$ su…

Let $\mathcal C$ be a class of graphs of bounded stretch-width. For an $n$-vertex graph $G\in\mathcal C$, let the clique-width of $G$ be the minimum number of labels needed to cons…