Jones' Conjecture in subcubic graphs
Combinatorics
2021-10-14 v1 Discrete Mathematics
Abstract
We confirm Jones' Conjecture for subcubic graphs. Namely, if a subcubic planar graph does not contain vertex-disjoint cycles, then it suffices to delete vertices to obtain a forest.
Cite
@article{arxiv.1912.01570,
title = {Jones' Conjecture in subcubic graphs},
author = {Marthe Bonamy and François Dross and Tomáš Masařík and Wojciech Nadara and Marcin Pilipczuk and Michał Pilipczuk},
journal= {arXiv preprint arXiv:1912.01570},
year = {2021}
}