The Linear2-arboricity Of Planar Graphs Without Chordal-5-cycle And Chordal-6-cycle

The linear2-arboricity1α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 most2.We study the linear2-arboricity of planar graphs without chordal-5-cycle and chordal-6-cycle. Main results are described as follows:If G is a graph without chordal-5-cycle and chordal-6-cycle, then...