The linear arboricity of planar graphs without 5-cycles with two chords
Xianglian Chen, Jianliang Wu · Filomat · 2016
The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G. In this paper, it is proved that for a planar graph G,la(G)=?(?(G)/2)? if ?(G) ? 7 and G has no 5-cycles with two chords.