Jones' Conjecture in subcubic graphs

Marthe Bonamy (1) , François Dross (2) , Tomáš Masařík , Wojciech Nadara , Marcin Pilipczuk (3) , Michał Pilipczuk (4)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 Institute of Mathematics [Warsaw]
3 MIMUW - Faculty of Mathematics, Informatics, and Mechanics [Warsaw]
4 UW - University of Warsaw

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.

Domaines: Algorithme et structure de données [cs.DS]; Combinatoire [math.CO]; Mathématique discrète [cs.DM]

Marthe Bonamy, François Dross, Tomáš Masařík, Wojciech Nadara, Marcin Pilipczuk, et al.. Jones' Conjecture in subcubic graphs. 2019. ⟨hal-02402899⟩