Decomposing a triangle-free planar graph into a forest and a subcubic forest
Combinatorics
2023-02-07 v3
Abstract
We strengthen a result of Dross, Montassier and Pinlou (2017) that the vertex set of every triangle-free planar graph can be decomposed into a set that induces a forest and a set that induces a forest with maximum degree at most , showing that can be replaced by .
Keywords
Cite
@article{arxiv.2012.15100,
title = {Decomposing a triangle-free planar graph into a forest and a subcubic forest},
author = {Carl Feghali and Robert Šámal},
journal= {arXiv preprint arXiv:2012.15100},
year = {2023}
}
Comments
9 pages; implemented referees' suggestions