… number of planar signed graphs we give the … signed graphs. Finally, reformulating Hadwiger's
conjecture in the language of homomorphism of signed graphs whose underlying graph is …

… A closed walk in a signed graph is said to be positive (negative) if it has an even (odd) … of
a signed graph, we define a homomorphism of a signed graph ( G , σ ) to a signed graph ( H , π …

… homomorphisms of signed graphs on sparse families, in this paper we first prove that for any
given signed graph (H, π), there is a positive value of ϵ such that, if G is a connected graph …

… homomorphisms of signed graphs from an algorithmic point of view. We study two natural
types of homomorphism problems on signed graphs, … a large class of signed graphs, while for …

… By considering signed graphs where all edges are of the same sign, we observe that graph
homomorphisms are a special case of signed graph homomorphisms. From a complexity …

… about the homomorphism order of 2-edge-colored graphs, but, … homomorphisms of 2-edge-colored
graphs under the umbrella of edge-sign-preserving homomorphisms of signed graphs…

… that a signed graph is balanced if every cycle in the graph is positive. It is known [2] that a
signed graph is … We can finally define the main definition—homomorphism of signed graphs. …

… Guenin, after introducing the notion of signedgraph homomorphisms, provided a further …
The theory of homomorphisms of signed graphs includes in particular the theory of graph …

… We consider homomorphisms of signed graphs from a … topics – graph homomorphisms
and signed graphs. Their … In the study of computational aspects of graph homomorphisms, …

… homomorphism problems of signed graphs from a computational point of view. A signed graph
is an undirected graph … complexity of graph and signed graph homomorphism problems. …