Jones' Conjecture in subcubic graphs

12/03/2019
by   Marthe Bonamy, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset