Name
Abstract | ||
|---|---|---|
We study homomorphism problems of signed graphs from a computational point of view. A signed graph is an undirected graph where each edge is given a sign, positive or negative. An important concept when studying signed graphs is the operation of switching at a vertex, which is to change the sign of each incident edge. A homomorphism of a graph is a vertex-mapping that preserves the adjacencies; in the case of signed graphs, we also preserve the edge-signs. Special homomorphisms of signed graphs, called s-homomorphisms, have been studied. In an s-homomorphism, we allow, before the mapping, to perform any number of switchings on the source signed graph. The concept of s-homomorphisms has been extensively studied, and a full complexity classification (polynomial or NP-complete) for s-homomorphism to a fixed target signed graph has recently been obtained. Nevertheless, such a dichotomy is not known when we restrict the input graph to be planar, not even for non-signed graph homomorphisms. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.dam.2020.03.029 | Discrete Applied Mathematics |
Keywords | DocType | Volume |
Signed graph,Edge-coloured graph,Graph homomorphism,Planar graph | Journal | 284 |
ISSN | Citations | PageRank |
0166-218X | 1 | 0.35 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| François Dross | 1 | 10 | 5.83 |
| Florent Foucaud | 2 | 122 | 19.58 |
| Valia Mitsou | 3 | 40 | 7.90 |
| Pascal Ochem | 4 | 258 | 36.91 |
| Théo Pierron | 5 | 1 | 1.36 |