@article{KM19rootedminorslinegraphs,
title={Rooted complete minors in line graphs with a Kempe coloring},
author={Kriesell, Matthias and Mohr, Samuel},
journal={Graphs and Combinatorics},
volume={35},
number={2},
pages={551--557},
year={2019},
publisher={Springer},
biburl = {http://samuel-mohr.de/files/bib/6.bib},
doi = {10.1007/s00373-019-02012-7},
archivePrefix = {arXiv},
eprint = {1804.06641},
abstract = { 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.}
}