相关论文: The complexity of signed graph and edge-coloured g…

The Hom complex ${\rm Hom}(T,G)$ of graphs is a CW-complex associated to a pair of graphs $T$ and $G$, considered in the graph coloring problem. It is known that certain homotopy invariants of ${\rm Hom}(T,G)$ give lower bounds for the…

Given a signing $\sigma\colon E(K_{n,n})\to\{-1,+1\}$ of the complete bipartite graph, when does $K_{n,n}$ admit a $1$-factorization in which every perfect matching has discrepancy bounded below by a positive absolute constant? Unlike the…

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

For a graph $F$, a graph $G$ is \emph{$F$-free} if it does not contain an induced subgraph isomorphic to $F$. For two graphs $G$ and $H$, an \emph{$H$-coloring} of $G$ is a mapping $f:V(G)\rightarrow V(H)$ such that for every edge $uv\in…

Given a loop-free graph $H$, the reconfiguration problem for homomorphisms to $H$ (also called $H$-colourings) asks: given two $H$-colourings $f$ of $g$ of a graph $G$, is it possible to transform $f$ into $g$ by a sequence of single-vertex…

We give a characterization of when a signed graph $G$ with a pair of distinguished edges $e_1, e_2 \in E(G)$ has the property that all cycles containing both $e_1$ and $e_2$ have the same sign. This answers a question of Zaslavsky.

An edge-colored graph is said to be balanced if it has an equal number of edges of each color. Given a graph $G$ whose edges are colored using two colors and a positive integer $k$, the objective in the Edge Balanced Connected Subgraph…

In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graphs are identical. However, two graphs $ G_A $ and $ G_B $ can…

A simple topological graph T = (V(T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges pass through a single crossing. Topological graphs G and H…

We present a edge-coloured analogue of the duality theorem for transitive tournaments and directed paths. Given a edge-coloured path $P$ whose edges alternate blue and red, we construct a edge-coloured graph $D$ so that for any…

The Surjective H-Colouring problem is to test if a given graph allows a vertex-surjective homomorphism to a fixed graph H. The complexity of this problem has been well studied for undirected (partially) reflexive graphs. We introduce…

Given a graph $G$ and two graph homomorphisms $\alpha$ and $\beta$ from $G$ to a fixed graph $H$, the problem $H$-Recoloring asks whether there is a transformation from $\alpha$ to $\beta$ that changes the image of a single vertex at each…

The chromatic number $\chi((G,\sigma))$ of a signed graph $(G,\sigma)$ is the smallest number $k$ for which there is a function $c : V(G) \rightarrow \mathbb{Z}_k$ such that $c(v) \not= \sigma(e) c(w)$ for every edge $e = vw$. Let…

We study the complexity of a class of promise graph homomorphism problems. For a fixed graph H, the H-colouring problem is to decide whether a given graph has a homomorphism to H. By a result of Hell and Ne\v{s}et\v{r}il, this problem is…

A seminal result by Whitney describes when two graphs have the same cycles. We consider the analogous problem for even cycle matroids. A representation of an even cycle matroid is a pair formed by a graph together with a special set of…

Let G=(V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v in V dominates its closed neighborhood N[v]. A vertex set D in G is an efficient dominating (e.d.) set for G if for every vertex v in V, there is…

A signed tree-coloring of a signed graph $(G,\sigma)$ is a vertex coloring $c$ so that $G^{c}(i,\pm)$ is a forest for every $i\in c(u)$ and $u\in V(G)$, where $G^{c}(i,\pm)$ is the subgraph of $(G,\sigma)$ whose vertex set is the set of…

The study on parity signed graphs was initiated by Acharya and Kureethara very recently and then followed by Zaslavsky etc.. Let $(G,\sigma)$ be a signed graph on $n$ vertices. If $(G,\sigma)$ is switch-equivalent to $(G,+)$ at a set of…

Say that an edge of a graph G dominates itself and every other edge adjacent to it. An edge dominating set of a graph G = (V,E) is a subset of edges E' of E which dominates all edges of G. In particular, if every edge of G is dominated by…

A signed graph is a graph whose edges are signed. In a vertex-signed graph the vertices are signed. The latter is called consistent if the product of signs in every circle is positive. The line graph of a signed graph is naturally…