Decomposing a triangle-free planar graph into a forest and a subcubic forest

2020/12/30 by Feghali, Carl, Šámal, Robert · 1 citation
#05C15 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2012.15100

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 5, showing that 5 can be replaced by 3.

Cited by

• Partitioning triangle-free planar graphs into a forest and a linear forest

Related

• Partitioning triangle-free planar graphs into a forest and a linear forest
• Partitioning a Planar Graph into two Triangle-Forests
• Partitioning a triangle-free planar graph into a forest and a forest of\n bounded degree
• Partitioning planar graphs without 4-cycles and 6-cycles into a forest and a disjoint union of paths
• A better bound on the largest induced forests in triangle-free planar graphs