On the linear k-arboricity of cubic graphs

Bermond et al. [2] conjectured that the edge set of a cubic graph G can be partitioned into two k-linear forests, that is to say two forests whose connected components are paths of length at most k, for all k ⩾ 5. We shall prove a weaker result that the statement is valid for all k ⩾ 18.