Odd Hadwiger for line-graphs
Raphael Steiner · Discrete Mathematics · 2022
Gerards and Seymour conjectured in 1995 that every graph G contains Kχ(G) as an odd-minor, this strengthening of Hadwiger's conjecture is known as the Odd Hadwiger's conjecture. We give a short proof that this conjecture holds for line-graphs of simple graphs.