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.
Note that while a minimum clique covering is always possible using only maximal cliques (so only maximal cliques need be considered when determining a graph's clique covering number), non-maximal cliques may also produce coverings of minimum size.
