Jones’ conjecture in subcubic graphs

Marthe Bonamy, François Dross, Tomáš Masařík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Micha̷l Pilipczuk

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)
50 Downloads (Pure)


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.

Original languageEnglish
Article numberP4.5
JournalElectronic Journal of Combinatorics
Issue number4
Publication statusPublished - 08 Oct 2021

Bibliographical note

Funding Information:
∗This research is a part of projects that have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, Grant Agreements 677651 and 714704.

Publisher Copyright:
© The authors.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Jones’ conjecture in subcubic graphs'. Together they form a unique fingerprint.

Cite this