1 problem

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…