Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
