The Linear2-arboricity Of Several Special Planar Graphs

Let G(V, E) be a simple planar graph with maximum degree△(G). The linear2-arboricity la2(G) of G is the least integer k such that G can be partitioned into k edge-disjoint linear2-forest of which each component is a path of length at most2. In this paper, we prove that:(1) Let G be a planar graph, if G is a (k,1)-genetic graph, then(2) If G be a planar graph without chordal6-cycle, then...