Found 1 document(s)
Page 1 of 1
-
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by allowing to use not only stable sets but also cliques to cover all the vertices of a given gra...