Concepts of signed graph coloring - ScienceDirect Skip to main contentSkip to article Elsevier
logo Journals & Books Help Search My account Sign in View PDF Download full issue Search …

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 …

A signed graph is a pair $(G,\sigma) $, where $ G $ is a graph and $\sigma: E (G)\to\{+,-\} $
is a signature which assigns to each edge of $ G $ a sign. Various notions of coloring of …

We study homomorphism problems of signed graphs from a computational point of view. A
signed graph (G, Σ) is a graph G where each edge is given a sign, positive or negative; Σ⊆ …

On edge colorings of 1-planar graphs Page 1 Information Processing Letters 111 (2011) 124–128
Contents lists available at ScienceDirect Information Processing Letters www.elsevier.com/locate/ipl …

Let (be two positive integers. We generalize the well‐studied notions of‐colorings and of the
circular chromatic number to signed graphs. This implies a new notion of colorings of signed …

We conjecture that every signed graph of unbalanced girth 2g, whose underlying graph is
bipartite and planar, admits a homomorphism to the signed projective cube of dimension …

A complexity dichotomy for signed H-colouring - ScienceDirect Skip to main contentSkip to
article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

In this article, we introduce and study the properties of some target graphs for 2‐edge‐
colored homomorphism. Using these properties, we obtain in particular that the 2‐edge …

A signed bipartite (simple) graph (G, σ) is said to be C− 4-critical if it admits no
homomorphism to C− 4 (a negative 4-cycle) but each of its proper subgraphs does. To …