中文摘要：

线性2-森林是每个连通分支是长度至多为2的路的图,图的线性2-荫度是将边分解为k个线性2-森林的最小k值,记为la2（G）.证明了若G为不含弦6-圈的平面图,则la2（G）≤[△（G）/2]＋6.

英文摘要：

A linear 2-forest is a forest whose components are paths of length at most 2. The linear 2-arboricity of a graph G, is the least integer k, so that G can be decomposed into k linear 2-forests, which is denoted by la2 （ G）. We get that if G is a planar graph without chordal-6-cycles, then la2（G）≤[△（G）/2]＋6.