Marthe Bonamy, François Dross, Tomáš Masařík, Wojciech Nadara, M·2019-12-04·via math.CO updates on arXiv.org
We confirm Jones' Conjecture for subcubic graphs. Namely, if a subcubic planar graph does not contain $k+1$ vertex-disjoint cycles, then it suffices to delete $2k$ vertices to obtain a forest.