Sciweavers

JGAA
2006
83views more  JGAA 2006»
14 years 13 days ago
On the approximation of Min Split-coloring and Min Cocoloring
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
Marc Demange, Tinaz Ekim, Dominique de Werra