Rooted Complete Minors in Line Graphs with a Kempe Coloring

@article{Kriesell2019RootedCM,
title={Rooted Complete Minors in Line Graphs with a Kempe Coloring},
author={Matthias Kriesell and Samuel Mohr},
journal={Graphs and Combinatorics},
year={2019},
volume={35},
pages={551-557}
}

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.

This is a survey of Hadwiger’s conjecture from 1943, that for all t ≥ 0, every graph either can be t-coloured, or has a subgraph that can be contracted to the complete graph on t + 1 vertices. This… Expand

It is proved that if G has no antitriangles and G has exactly one c(G)-coloring then s(G) is at least |V(G)|/2, where the proof does not use the four-color-theorem.Expand

It is shown (without assuming the 4CC) that every minimal counterexample to Hadwiger's conjecture whent=5 is “apex”, that is, it consists of a planar graph with one additional vertex.Expand

Gaph Teory Fourth Edition is standard textbook of modern graph theory which covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each chapter by one or two deeper results.Expand