Jones' Conjecture in subcubic graphs

12/03/2019

∙

by   Marthe Bonamy, et al.

∙

0

∙

share

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.