Hajَsʹ conjecture for line graphs

We prove that, if a graph G (without multiple edges) has maximum degree d and edge-chromatic number d + 1 , then G contains two distinct vertices x , y and a collection of d pairwise edge-disjoint paths between x and y. In particular, the line graph of G satisfies Hajَsʹ conjecture.