Abstract
Hadwiger’s Conjecture states that every k-chromatic graph has a complete minor of order k. A graph G′ is an inflation of a graph G if G′ is obtained from G by replacing each vertex v of G by a clique Cv and joining two vertices of distinct cliques by an edge if and only if the corresponding vertices of G are adjacent. We present an algorithm for computing an upper bound on the chromatic number χ(G′) of any inflation G′ of any 3-chromatic graph G. As a consequence, we deduce that Hadwiger’s Conjecture holds for any inflation of any 3-colorable graph.
Sign-in/Register to access full text options 
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.
