Cocoloring
|
|
In graph theory, a cocoloring of a graph G is an assignment of colors to the vertices such that each color class forms an independent set in G or the complement of G.
The cochromatic number z(G) of G is the least number of colors needed in any cocolorings of G.