Whether the cliquewidth of the graphs in this class is bounded by a
The cliquewidth of a graph is the number of different labels
that is needed to construct the graph using the following
- creation of a vertex with label i,
- disjoint union,
- renaming labels i to label j,
- connecting all vertices with label i to all
vertices with label j.