A clique covering of a graph is set of cliques such that every vertex of 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 .

# Clique Covering

## See also

Clique, Clique Covering Number, Maximum Clique## Explore with Wolfram|Alpha

## References

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. https://mathworld.wolfram.com/CliqueCovering.html