Abstract. The conjecture of linear arboricity states that every n-regular graph can be decomposed into |_n/2_|+1 linear forests. This conjecture seems to be a very strong one. In this paper we prove that every n-regular graph can be decomposed into |_n/2_|+1 forests, whose maximmum degrees do not exceed |_(n+1)/2_|.