Journal Articles
Journal of Discrete Algorithms
Year : 2012
Jean-Francois Couturier : Connect in order to contact the contributor
https://hal.science/hal-02332177
Submitted on : Thursday, October 24, 2019-4:35:11 PM
Last modification on : Friday, April 19, 2024-1:44:22 PM
Cite
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. Journal of Discrete Algorithms, 2012, 15, pp.56-62. ⟨10.1016/j.jda.2012.04.008⟩. ⟨hal-02332177⟩
Collections
21
View
0
Download