Loading...
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.
Type
report
Authors
Publication date
2006
EPFL units
Available on Infoscience
September 27, 2006
Use this identifier to reference this record