Clique Covering

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 theta(G).

See also

Clique, Clique Covering Number, Maximum Clique

Explore with Wolfram|Alpha


West, D. B. Introduction to Graph Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, p. 319, 2000.

Cite this as:

Weisstein, Eric W. "Clique Covering." From MathWorld--A Wolfram Web Resource.

Subject classifications