A note on the linear 2-arboricity of planar graphs without adjacent short cycles
Zongzheng Zhao, Mei Yao, Changqing Xu · International Journal of Applied Mathematics & Statistics/International journal of applied mathematics and statistics · 2013
The linear 2-arboricity of a graph G is the least integer k such that G can be partitioned into k edge disjoint forests, whose component trees are paths of length at most 2. We give an upper bound of linear 2-arboricity of planar graphs without adjacent short cycles, where the short cycle means a cycle of length 3 or 4.