Homomorphisms of signed graphs: An update

A signed graph is a graph together with an assignment of signs to the edges. A closed walk in a signed graph is said to be positive (negative) if it has an even (odd) number of negative edges, counting repetition. Recognizing the signs of closed walks as one of the key structural properties of a signed graph, we define a homomorphism of a signed graph $(G,\sigma)$ to a signed graph $(H, \pi)$ to be a mapping of vertices and edges of $G$ to (respectively) vertices and edges of $H$ which preserves incidence, adjacency and the signs of closed walks. In this work we first give a characterization of the sets of closed walks in a graph $G$ that correspond to the set of negative walks in some signed graph on $G$. We also give an easy algorithm for the corresponding decision problem. After verifying the equivalence between this definition and earlier ones, we discuss the relation between homomorphisms of signed graphs and those of 2-edge-colored graphs. Next we provide some basic no-homomorphism lemmas. These lemmas lead to a general method of defining chromatic number which is discussed at length. Finally, we list a few problems that are the driving force behind the study of homomorphisms of signed graphs.

[1]  Andrzej Szepietowski.  Negative closed walks in signed graphs: A note , 2019, ArXiv.

[2]  Reza Naserasr.  Mapping Planar Graphs into Projective Cubes , 2013, J. Graph Theory.

[3]  Jaroslav Nesetril,et al.  Graphs and homomorphisms , 2004, Oxford lecture series in mathematics and its applications.

[4]  Reza Naserasr,et al.  Homomorphisms and edge-colourings of planar graphs , 2007, J. Comb. Theory B.

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

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

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

[8]  Cun-Quan Zhang,et al.  (2 + ϵ)-Coloring of planar graphs with large odd-girth , 2000, J. Graph Theory.

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

[10]  Thomas Zaslavsky,et al.  Is There a Matroid Theory of Signed Graph Embedding? , 1997, Ars Comb..

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

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

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

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

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

[16]  Richard C. Brewster,et al.  Edge-switching homomorphisms of edge-coloured graphs , 2009, Discret. Math..

[17]  Carsten Thomassen,et al.  Embeddings of graphs with no short noncontractible cycles , 1990, J. Comb. Theory, Ser. B.

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

[19]  Richard Brewster.  Vertex colourings of edge-coloured graphs , 1993 .

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

[21]  T. Zaslavsky.  A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas , 2018, The Electronic Journal of Combinatorics.

[22]  Xuding Zhu.  Circular Chromatic Number of Planar Graphs of Large Odd Girth , 2001, Electron. J. Comb..

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

[24]  William F. Klostermeyer,et al.  (2 + ε)-Coloring of planar graphs with large odd-girth , 2000 .

[25]  Thomas Zaslavsky,et al.  Characterizations of signed graphs , 1981, J. Graph Theory.

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

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

[28]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

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

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

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

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

[33]  F. Jaeger.  ON CIRCULAR FLOWS IN GRAPHS , 1984 .

[34]  Qiang Sun,et al.  Walk-Powers and Homomorphism Bounds of Planar Signed Graphs , 2016, Graphs Comb..