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.
Bibliographical noteFunding 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.
© The authors.
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics