Add to ORKGAbstract. A Weight graph is a connected (multi)graph with two ver-tices u and v of degree at least three and other vertices of degree two. Moreover, if any of these two vertices is removed, the remaining graph contains a cycle. A Weight graph is called simple if the degree of u and v is three. We show full computational complexity characterization of the problem of deciding the existence of a locally injective homomorphism from an input graph G to any fixed simple Weight graph by identifying some polynomial cases and some NP-complete cases
The Surjective Homomorphism problem is to test whether a given graph G called the guest graph allows...
A homomorphism from a graph G to a graph H is a function from the vertices of G to the vertices of H...
Given graphs G and H, a mapping f:V(G) → V(H) is a homomorphism if (f(u),f(v)) is an edge of H for e...
For graphs $G$ and $H$, a homomorphism from $G$ to $H$ is a function $\varphi \colon V(G) \to V(H)$,...
For oriented graphs $G$ and $H$, a homomorphism $f: G \rightarrow H$ islocally-injective if, for eve...
Abstract. A homomorphism from a graph G to a graph H is locally bijective, surjective, or injective ...
A homomorphism from a graph G to a graph H is locally bijective, surjective, or injective if its res...
A homomorphism from a graph g to a graph h is locally bijective, surjective, or injective if its res...
A homomorphism from a graph G to a graph H is locally bijective, injective, or surjective if its res...
We prove that in the List version, the problem of deciding the existence of a locally injective homo...
In this paper we give a graph theoretic proof of the fact that deciding whether a homomorphism exist...
AbstractWe explore the connection between locally constrained graph homomorphisms and degree matrice...
A graph homomorphism is an edge preserving vertex mapping between two graphs. Locally constrained ho...
The Surjective Homomorphism problem is to test whether a given graphG called the guest graph allows ...
We study the parameterized complexity of the problem of counting graph homomorphisms with given part...
The Surjective Homomorphism problem is to test whether a given graph G called the guest graph allows...
A homomorphism from a graph G to a graph H is a function from the vertices of G to the vertices of H...
Given graphs G and H, a mapping f:V(G) → V(H) is a homomorphism if (f(u),f(v)) is an edge of H for e...
For graphs $G$ and $H$, a homomorphism from $G$ to $H$ is a function $\varphi \colon V(G) \to V(H)$,...
For oriented graphs $G$ and $H$, a homomorphism $f: G \rightarrow H$ islocally-injective if, for eve...
Abstract. A homomorphism from a graph G to a graph H is locally bijective, surjective, or injective ...
A homomorphism from a graph G to a graph H is locally bijective, surjective, or injective if its res...
A homomorphism from a graph g to a graph h is locally bijective, surjective, or injective if its res...
A homomorphism from a graph G to a graph H is locally bijective, injective, or surjective if its res...
We prove that in the List version, the problem of deciding the existence of a locally injective homo...
In this paper we give a graph theoretic proof of the fact that deciding whether a homomorphism exist...
AbstractWe explore the connection between locally constrained graph homomorphisms and degree matrice...
A graph homomorphism is an edge preserving vertex mapping between two graphs. Locally constrained ho...
The Surjective Homomorphism problem is to test whether a given graphG called the guest graph allows ...
We study the parameterized complexity of the problem of counting graph homomorphisms with given part...
The Surjective Homomorphism problem is to test whether a given graph G called the guest graph allows...
A homomorphism from a graph G to a graph H is a function from the vertices of G to the vertices of H...
Given graphs G and H, a mapping f:V(G) → V(H) is a homomorphism if (f(u),f(v)) is an edge of H for e...