Misra, Neeldhara; Panolan, Fahad; Rai, Ashutosh; Raman, Venkatesh; Saurabh, Saket
(Springer Verlag, 2018-04)
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 (Inf Process Lett ...