Abstract
The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G. In 1980, Akiyama et al. conjectured that for any graph G, \la{\Delta(G)}\leq la(G) \leq \la{\Delta(G)+1}. In the paper, we establish the essential structural properties of W_5-minor free graphs G and then prove here that if G is a W_5-minor free graph and \Delta (G)\geq 5, then la(G)= \la{\Delta(G)}.

This publication has 24 references indexed in Scilit: