A note on the linear 2-arboricity of planar graphs

The linear 2-arboricity la2(G) of a graph G is the least integer k such that G can be partitioned into k edge-disjoint forests, whose components are paths of length at most 2. In this paper, we prove that every planar graph G with Δ=10 has la2(G)≤9. Using this result, we correct an error in the proof of a result in Wang (2016), which says that every planar graph G satisfies la2(G)≤⌈(Δ+1)∕2⌉+6.