Hadwiger's Conjecture and inflations of the Petersen graph

An inflation of a graph G is obtained by replacing vertices in G by disjoint cliques and adding all possible edges between any pair of cliques corresponding to adjacent vertices in G . We prove that the chromatic number of an arbitrary inflation F of the Petersen graph is equal to the chromatic number of some inflated 5-cycle contained in F . As a corollary, we find that Hadwiger's Conjecture holds for any inflation of the Petersen graph. This solves a problem posed by Bjarne Toft.

[1]  Paul D. Seymour,et al.  Graph Minors. XIX. Well-quasi-ordering on a surface , 2004, J. Comb. Theory, Ser. B.

[2]  Paul A. Catlin,et al.  Hajós' graph-coloring conjecture: Variations and counterexamples , 1979, J. Comb. Theory, Ser. B.

[3]  O. Ore.  The Four-Color Problem , 1967 .

[4]  László Lovász,et al.  Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[5]  G. A. Dirac,et al.  Note on the colouring of graphs , 1951 .

[6]  Carsten Thomassen,et al.  Some remarks on Hajo's' conjecture , 2005, J. Comb. Theory, Ser. B.

[7]  Michael Stiebitz,et al.  On a special case of Hadwiger's conjecture , 2003, Discuss. Math. Graph Theory.

[8]  J. A. Bondy,et al.  Graph Theory , 2008, Graduate Texts in Mathematics.

[9]  Robin J. Wilson,et al.  Edge-colourings of graphs , 1977 .

[10]  B. Toft.  Hadwiger Conjecture for Inflations of the Petersen Graph , 2008 .