In graph theory, the clique-width of a graph  is the minimum number of labels needed to construct by means of the following 4 operations :

1. Creation of a new vertex v with label i ( noted i(v) )
2. Disjoint union of two labeled graphs G and H ( denoted )
3. Joining by an edge every vertex labeled i to every vertex labeled j (denoted n(i,j)), where
4. Renaming label i to label j ( denoted p(i,j) )

In graph theory, the clique-width of a graph  is the minimum number of labels needed to construct by means of the following 4 operations :

1. Creation of a new vertex v with label i ( noted i(v) )
2. Disjoint union of two labeled graphs G and H ( denoted )
3. Joining by an edge every vertex labeled i to every vertex labeled j (denoted n(i,j)), where
4. Renaming label i to label j ( denoted p(i,j) )