Precoloring with cliques and stable sets in cographs
Marc Demange, Tınaz Ekim · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · 2006
Precoloring extension problems are known to be NP-complete in several classes of graphs. Here, we consider precolorings of cographs with not only stable sets but also with cliques. We give polynomial time algorithms to extend such a precoloring in an optimal way according to several objective functions.