Hajós' conjecture for line graphs (Q858687)

G. Hajós conjectured (1961) that if a graph has chromatic number \(k\), then it contains a subdivision of \(K_k\). Counterexamples are known that are line graphs of multigraphs. Here it is proved that if a graph \(X\) without multiple edges has maximum valence \(d\) and edge-chromatic number \(d+1\), then \(X\) has a pair of vertices joined by a \(d\)-set of edge-disjoint paths. Moreover, the line graph of \(X\) satisfies Hajós' conjecture.