The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree

Christopher Duffy, Fabien Jacques, Mickael Montassier +1

A 2-edge-colored graph or a signed graph is a simple graph with two types of edges. A homomorphism from a 2-edge-colored graph $G$ to a 2-edge-colored graph $H$ is a mapping $φ: V(…