HOSIGRA

A 2-edge-colored graph is a graph where each edge is assigned one of the two possible colors (normally red or blue).

In some text signed graphs are studied just as they are 2-edge-colored graphs. In our work we will distinguish the two using the algebra on signs which would not apply to colors. This manifests in the form of resigning.

However there remains strong connection between homomorphisms of signed graphs and homomorphisms of 2-edge-colored graph.

For studies on homomorphism of 2-edge colored graphs we refer to the following references: