Hadwigers Conjecture for inflations of 3-chromatic graphs
2016 (English)In: European journal of combinatorics (Print), ISSN 0195-6698, E-ISSN 1095-9971, Vol. 51, 99-108 p.Article in journal (Refereed) Published
Hadwigers 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 upsilon of G by a clique C-upsilon 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 chi (G) of any inflation G of any 3-chromatic graph G. As a consequence, we deduce that Hadwigers Conjecture holds for any inflation of any 3-colorable graph. (C) 2015 Elsevier Ltd. All rights reserved.
Place, publisher, year, edition, pages
ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD , 2016. Vol. 51, 99-108 p.
IdentifiersURN: urn:nbn:se:liu:diva-122185DOI: 10.1016/j.ejc.2015.05.003ISI: 000362144400007OAI: oai:DiVA.org:liu-122185DiVA: diva2:865071
Funding Agencies|SVeFUM; Mittag-Leffler Institute2015-10-262015-10-232015-11-19