A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the complexity of the selective graph coloring problem in some special classes of graphs
2014
Theoretical Computer Science
In this paper, we consider the selective graph coloring problem. Given an integer k ≥ 1 and a graph G = (V, E) with a partition V 1 , . . . , V p of V , it consists in deciding whether there exists a set V * in G such that V * ∩ V i = 1 for all i ∈ {1, . . . , p}, and such that the graph induced by V * is k-colorable. We investigate the complexity status of this problem in various classes of graphs.
doi:10.1016/j.tcs.2013.04.018
fatcat:bg3vx2zdo5enpiocal22u3wihi