Jones' conjecture in subcubic graphs (Q2236806)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Jones' conjecture in subcubic graphs |
scientific article |
Statements
Jones' conjecture in subcubic graphs (English)
0 references
26 October 2021
0 references
Summary: 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.
0 references
cycle packing
0 references
feedback vertex set
0 references
