The linear 2-arboricity of planar graphs without 4-cycles
Weifan Wang · Journal of Zhejiang Normal University · 2006
The linear 2-arboricity la_2(G) 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.It was proved that la_2(G)≤[JX*2/5][JX-*2/5]Δ(G)+1[]2+3 if G is a planar graph without 4-ycles.[SD21*3,1]