A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We address the parameterized complexity of Max Colorable Induced Subgraph on perfect graphs. The problem asks for a maximum sized q-colorable induced subgraph of an input graph G. Yannakakis and Gavril [ IPL 1987 ] showed that this problem is NP-complete even on split graphs if q is part of input, but gave a n O(q) algorithm on chordal graphs. We first observe that the problem is W-hard parameterized by q, even on split graphs. However, when parameterized by , the number of vertices in thedoi:10.1007/978-3-642-45043-3_32 fatcat:tyxfpsbqm5bgdcrzzgdmjuiqea