摘要：

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.We prove that la_2(G)≤(Δ(G)+5)/2 if G is a K4-minor-free graph with maximum degreeΔ(G).

展开