不含弦5-圈和弦6-圈的平面图的线性2-荫度.pdfVIP

不含弦5-圈和弦6-圈的平面图的线性2-荫度 ABSTRACT The linear 2-arboricity 2 of a graph is the least integer such that can be partitioned into edge-disjoint forests, whose component trees are paths of length at most 2. We study the linear 2- arboricity of planar graphs without chordal-5-cycle and chordal-6-cycle. Main results are described as follows: If is a graph without chordal-5-cycle and chordal-6-cycle,