[1]
Dross, F., Montassier, M. and Pinlou, A. 2018. Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree. The Electronic Journal of Combinatorics. 25, 1 (Mar. 2018), P1.45. DOI:https://doi.org/10.37236/6815.