The complexity of the list homomorphism problem for signed graphs appear...
The notion of graph covers is a discretization of covering spaces introd...
The CSP dichotomy conjecture has been recently established, but a number...
A graph covering projection, also known as a locally bijective homomorph...
Partially defined cooperative games are a generalisation of classical
co...
We initiate the study of computational complexity of graph coverings, ak...
Partially defined cooperative games are a generalisation of classical
co...
A k-colouring c of a graph G is a mapping V(G) to 1,2,... k such that c(...
We consider homomorphisms of signed graphs from a computational perspect...
The Wiener index is a graph parameter originating from chemical graph
th...
An extension of the well-known Szeged index was introduced recently, nam...
Cooperative interval game is a cooperative game in which every coalition...
In this short note, we show two NP-completeness results regarding the
si...
In this paper we study edge-sum distinguishing labeling, a type of
label...
We investigate the paramater of the average range of M-Lipschitz mapping...
M-Lipschitz mappings of graphs (or equivalently graph-indexed random wal...
We study three problems regarding the so called graph-indexed random wal...
In this paper we demonstrate that several theorems from Bres and
Bres3 d...