Rooted Complete Minors in Line Graphs with a Kempe Coloring
- 7 Downloads
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.
KeywordsColoring Clique minor Kempe coloring Line graph
Mathematics Subject Classification05c15 05c40
- 5.Kotzig, A.: Hamilton graphs and Hamilton circuits. Theory of graphs and its applications (Proc. Sympos. Smolenice, 1963), pp. 63–82Google Scholar