On the parameterized complexity of coloring graphs in the absence of a linear forest - Archive ouverte HAL Access content directly
Journal Articles Journal of Discrete Algorithms Year : 2012

Dates and versions

hal-02332177 , version 1 (24-10-2019)

Identifiers

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⟩
21 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More