A homomorphism of a signed graph
to
is a mapping of vertices and edges of
to (respectively) vertices and edges of
such that adjacencies, incidences, and the signs of closed walks are preserved. We observe in this work that, for
, the
‐coloring problem of a given graph
can be captured by homomorphism to
...