Vertex clique cover

Vertex clique cover --- покрытие вершин кликами.

A vertex clique cover is a collection of cliques that covers all vertices of [math]\displaystyle{ G }[/math].

The minimum number of cliques in a vertex clique cover is called the vertex clique cover number and denoted by [math]\displaystyle{ \theta(G) }[/math].