Jones' Conjecture in Subcubic Graphs

  • Marthe Bonamy
  • François Dross
  • Tomáš Masařík
  • Andrea Munaro
  • Wojciech Nadara
  • Marcin Pilipczuk
  • Michał Pilipczuk
DOI: https://doi.org/10.37236/9192

Abstract

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.

Published
2021-10-08
Issue
Volume 28, Issue 4 (2021)
Article Number
P4.5