科研之友
微信
新浪微博
Facebook
分享链接
摘要
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 components are paths of length at most 2. In this paper, we prove that every planar graph G with Delta = 10 has la(2)(G) <= 9. Using this result, we correct an error in the proof of a result in Wang (2016), which says that every planar graph G satisfies la(2)(G) <= [(Delta+1)/2] + 6.
