(I,F)-partition of planar graphs without cycles of length 4, 6, or 9

2023/03/08 by Kang, Yingli, Lu, Hongkai, Jin, Ligang
#05C10 #05C15 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2303.04648

Abstract

A graph G is (I,F)-partitionable if its vertex set can be partitioned into two parts such that one part is an independent set, and the other induces a forest. In this paper, we prove that every planar graph without cycles of length 4, 6, 9 is (I,F)-partitionable.

Related

• Partitioning planar graphs without 4-cycles and 6-cycles into a forest and a disjoint union of paths
• Partitioning a triangle-free planar graph into a forest and a forest of\n bounded degree
• Partitioning a Planar Graph into two Triangle-Forests
• Partitioning triangle-free planar graphs into a forest and a linear forest
• Equitable vertex arboricity of planar graphs