On the 4-color theorem for signed graphs

There are several ways to generalize graph coloring to signed graphs. Macajova, Raspaud and Skoviera introduced one of them and conjectured that in this setting, for signed planar graphs four colors are always enough, generalising thereby The Four Color Theorem. We disprove the conjecture.

[1]  André Kündgen,et al.  Coloring Face-Hypergraphs of Graphs on Surfaces , 2002, J. Comb. Theory, Ser. B.

[2]  Xuding Zhu.  A refinement of choosability of graphs , 2020, J. Comb. Theory, Ser. B.

[3]  Brendan D. McKay,et al.  The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices , 1988, J. Comb. Theory, Ser. B.

[4]  Robin Thomas,et al.  The Four-Colour Theorem , 1997, J. Comb. Theory, Ser. B.

[5]  Thomas Zaslavsky.  Signed graphs , 1982, Discret. Appl. Math..

[6]  Thomas Zaslavsky,et al.  Signed graph coloring , 1982, Discret. Math..

[7]  André Raspaud,et al.  The Chromatic Number of a Signed Graph , 2014, Electron. J. Comb..

[8]  H. Whitney.  2-Isomorphic Graphs , 1933 .

[9]  F. Harary.  On the notion of balance of a signed graph. , 1953 .