The linear 2-arboricity of a graph G is the least integer 3689b2a18dc5d" title="Click to view the MathML source">k such that G can be partitioned into 3689b2a18dc5d" title="Click to view the MathML source">k edge-disjoint forests, whose component trees are paths of length at most 2. In this paper, we prove that if G is a planar graph, then . This improves a result in Lih et al. (2003), which says that every planar graph G satisfies .