Concepts of signed graph coloring

This paper surveys recent development of concepts related to coloring of signed graphs. Various approaches are presented and discussed.

[1]  Seog-Jin Kim,et al.  A note on a Brooks' type theorem for DP‐coloring , 2017, J. Graph Theory.

[2]  Sandip Das,et al.  Chromatic number of signed graphs with bounded maximum degree , 2016, 1603.09557.

[3]  Thomas Zaslavsky.  The Signed Chromatic Number of the Projective Plane and Klein Bottle and Antipodal Graph Coloring , 1995, J. Comb. Theory, Ser. B.

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

[5]  Xiangwen Li,et al.  Every signed planar graph without cycles of length from 4 to 8 is 3-colorable , 2018, Discret. Math..

[6]  Seog-Jin Kim,et al.  Planar Graphs Without 4-Cycles Adjacent to Triangles are DP-4-Colorable , 2019, Graphs Comb..

[7]  Thomas Zaslavsky.  Biased Graphs .III. Chromatic and Dichromatic Invariants , 1995, J. Comb. Theory, Ser. B.

[8]  Ying-li Kang,et al.  The chromatic spectrum of signed graphs , 2016, Discret. Math..

[9]  F. Harary,et al.  On the Coloring of Signed Graphs. , 1968 .

[10]  Ying-li Kang,et al.  Circular coloring of signed graphs , 2018, J. Graph Theory.

[11]  Dénes König,et al.  Theorie der endlichen und unendlichen Graphen : kombinatorische Topologie der Streckenkomplexe , 1935 .

[12]  Yeong-Nan Yeh,et al.  Colouring of generalized signed triangle-free planar graphs , 2019, Discret. Math..

[14]  Charles J. Colbourn,et al.  Steiner trees, partial 2-trees, and minimum IFI networks , 1983, Networks.

[15]  Carsten Thomassen,et al.  A short list color proof of Grötzsch's theorem , 2003, J. Comb. Theory, Ser. B.

[16]  Nathan Linial,et al.  Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties , 1992, J. Comb. Theory, Ser. B.

[17]  A. Vince,et al.  Star chromatic number , 1988, J. Graph Theory.

[18]  Luke Postle,et al.  Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 , 2015, J. Comb. Theory B.

[19]  Thomas Zaslavsky.  Signed graphs: To: T. Zaslausky, Discrete Appl. Math 4 (1982) 47-74 , 1983, Discret. Appl. Math..

[20]  D. Koenig.  Theorie Der Endlichen Und Unendlichen Graphen , 1965 .

[21]  Xuding Zhu,et al.  Circular chromatic number: a survey , 2001, Discret. Math..

[22]  André Raspaud,et al.  Good and Semi-Strong Colorings of Oriented Planar Graphs , 1994, Inf. Process. Lett..

[23]  E. Sampathkumar,et al.  Coloring of signed graphs , 2013, CTW.

[24]  Sandip Das,et al.  Relative Clique Number of Planar Signed Graphs , 2016, CALDAM.

[25]  Andrzej Szepietowski,et al.  Signed coloring of 2-dimensional grids , 2020, Inf. Process. Lett..

[26]  Wayne Goddard,et al.  Acyclic colorings of planar graphs , 1991, Discret. Math..

[27]  Frank Harary,et al.  A simple algorithm to detect balance in signed graphs , 1980, Math. Soc. Sci..

[28]  Éric Sopena,et al.  Homomorphisms of Signed Graphs , 2013, J. Graph Theory.

[29]  M. Zając.  A short proof of Brooks' theorem , 2018 .

[30]  R. Steinberg.  The State of the Three Color Problem , 1993 .

[31]  Wei Wang,et al.  Alon-Tarsi Number and Modulo Alon-Tarsi Number of Signed Graphs , 2019, Graphs Comb..

[32]  Weili Wu,et al.  Steiner Trees , 2016, Encyclopedia of Algorithms.

[33]  Daniel Král,et al.  A note on group colorings , 2005, J. Graph Theory.

[34]  Ying-li Kang.  Coloring Signed Graphs , 2016 .

[35]  Thomas Zaslavsky.  Totally frustrated states in the chromatic theory of gain graphs , 2009, Eur. J. Comb..

[36]  André Raspaud,et al.  Colored Homomorphisms of Colored Mixed Graphs , 2000, J. Comb. Theory, Ser. B.

[37]  L. Vietoris.  Theorie der endlichen und unendlichen Graphen , 1937 .

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

[39]  Ying-li Kang,et al.  Choosability in signed planar graphs , 2016, Eur. J. Comb..

[40]  Michael Stiebitz,et al.  Degree choosable signed graphs , 2017, Discret. Math..

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

[42]  Pascal Ochem,et al.  Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs , 2017, J. Graph Theory.

[43]  Thomas Zaslavsky,et al.  Chromatic invariants of signed graphs , 1982, Discret. Math..

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

[45]  Éric Sopena,et al.  Homomorphisms of planar signed graphs to signed projective cubes , 2013, Discret. Math. Theor. Comput. Sci..

[46]  Thomas Zaslavsky,et al.  Homomorphisms of signed graphs: An update , 2021, Eur. J. Comb..

[47]  Richard C. Brewster,et al.  The complexity of signed graph and edge-coloured graph homomorphisms , 2015, Discret. Math..

[48]  Dimitri Lajou.  On the achromatic number of signed graphs , 2019, Theor. Comput. Sci..

[49]  Frantisek Kardos,et al.  On the 4-color theorem for signed graphs , 2019, Eur. J. Comb..

[50]  Tamás Fleiner,et al.  Coloring signed graphs using DFS , 2016, Optim. Lett..

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

[52]  Florent Foucaud,et al.  The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction , 2014, LATIN.

[53]  Margit Voigt,et al.  List colourings of planar graphs , 2006, Discret. Math..

[54]  Thomas Zaslavsky,et al.  How colorful the signed graph? , 1984, Discret. Math..

[55]  Richard C. Brewster,et al.  A complexity dichotomy for signed H-colouring , 2018, Discret. Math..

[56]  Pascal Ochem,et al.  Homomorphisms of signed planar graphs , 2014, ArXiv.

[57]  Carsten Thomassen,et al.  Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory B.

[59]  N. Alon,et al.  Homomorphisms of Edge-Colored Graphs and Coxeter Groups , 1998 .