KW Lih, LD Tong, WF Wang - Graphs and Combinatorics, 2003 - Springer
Let G be a planar graph with maximum degree Δ and girth g. The linear 2-arboricity la 2 (G)
of G is the least integer k such that G can be partitioned into k edge-disjoint forests, whose …