# Parameter: cliquewidth

Definition:

The cliquewidth of a graph is the number of different labels that is needed to construct the graph using the following operations:

• creation of a vertex with label $i$,
• disjoint union,
• renaming labels $i$ to label $j$, and
• connecting all vertices with label $i$ to all vertices with label $j$.

[+]Details

## Relations

Minimal/maximal is with respect to the contents of ISGCI. Only references for direct bounds are given. Where no reference is given, check equivalent parameters.

[+]Details

## Problems

Problems in italics have no summary page and are only listed when ISGCI contains a result for the current parameter.

3-Colourability FPT-Linear [+]Details
Clique FPT [+]Details
Clique cover XP [+]Details
Colourability FPT [+]Details
Domination FPT-Linear [+]Details
Feedback vertex set FPT [+]Details
Graph isomorphism XP [+]Details
Hamiltonian cycle XP [+]Details
Hamiltonian path XP [+]Details
Independent set FPT [+]Details
Maximum cut XP,W-hard [+]Details
Monopolarity Unknown to ISGCI [+]Details
Polarity XP [+]Details
Weighted clique FPT [+]Details
Weighted feedback vertex set FPT-Linear [+]Details
Weighted independent dominating set FPT-Linear [+]Details
Weighted independent set FPT-Linear [+]Details