Geodesic
On the approximation of Min Split-coloring and Min Cocoloring
Journal of Graph Algorithms and Applications, Tome 10 (2006) no. 2, pp. 297-315.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

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 all the vertices of a given graph. We prove the NP-hardness of some cases. We derive approximation results for Min Split-coloring and Min Cocoloring in line graphs, comparability graphs and general graphs. This provides to our knowledge the first approximation results for Min Split-coloring since it was defined only very recently [,,]. Also, we provide some results on the approximability of Min Cocoloring and comparisons with Min Split-coloring and Min Coloring.
DOI : 10.7155/jgaa.00129
Keywords: split-coloring, cocoloring, line graphs, approximation 
@article{JGAA_2006_10_2_a9,
     author = {Marc Demange and Tinaz Ekim and Dominique de Werra},
     title = {On the approximation of {Min} {Split-coloring} and {Min} {Cocoloring}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {297--315},
     publisher = {mathdoc},
     volume = {10},
     number = {2},
     year = {2006},
     doi = {10.7155/jgaa.00129},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00129/}
}
TY  - JOUR
AU  - Marc Demange
AU  - Tinaz Ekim
AU  - Dominique de Werra
TI  - On the approximation of Min Split-coloring and Min Cocoloring
JO  - Journal of Graph Algorithms and Applications
PY  - 2006
SP  - 297
EP  - 315
VL  - 10
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00129/
DO  - 10.7155/jgaa.00129
LA  - en
ID  - JGAA_2006_10_2_a9
ER  - 
%0 Journal Article
%A Marc Demange
%A Tinaz Ekim
%A Dominique de Werra
%T On the approximation of Min Split-coloring and Min Cocoloring
%J Journal of Graph Algorithms and Applications
%D 2006
%P 297-315
%V 10
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00129/
%R 10.7155/jgaa.00129
%G en
%F JGAA_2006_10_2_a9
Marc Demange; Tinaz Ekim; Dominique de Werra. On the approximation of Min Split-coloring and Min Cocoloring. Journal of Graph Algorithms and Applications, Tome 10 (2006) no. 2, pp. 297-315. doi : 10.7155/jgaa.00129. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00129/

Cité par Sources :