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 f......