On the parameterized complexity of coloring graphs in the absence of a linear forest

Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma. On the parameterized complexity of coloring graphs in the absence of a linear forest. J. Discrete Algorithms, 15:56-62, 2012. [doi]

Abstract

Abstract is missing.