An efficient case for computing minimum linear arboricity with small maximum degree

Graph coloring has interesting applications in optimization, calculation of Hessian matrix, network design and so on. In this paper, we consider an improper edge coloring which is one important coloring-linear arboricity. For a graph G, a linear forest is a disjoint union of paths and cycles. The linear arboricity la(G) is the minimum number of disjoint linear forests such that their union is exactly the edge set of G. In this paper, we study a special case that G is a simple planar graph with two not adjacent cycles each with a chordal and length between 4 and 7. We show that in this special case, $$la(G)=\lceil \frac{\Delta }{2}\rceil $$la(G)=⌈Δ2⌉ where $$\Delta $$Δ is the maximum vertex degree of G and $$\Delta \ge 7$$Δ≥7.