A clique covering of a graph G is set of cliques such that every vertex of G is a member of at least one clique. A minimum clique covering is a clique covering of minimum size, and the size of such a minimum clique covering is known as the clique covering number θ(G).

clique | clique covering number | maximum clique