  It has been conjectured that if a finite graph has a vertex coloring such
that the union of any two color classes induces a connected graph, then for
every set $T$ of vertices containing exactly one member from each color class
there exists a complete minor such that $T$ contains exactly one member from
each branching set. Here we prove the statement for line graphs.
