AbstractIn this paper we establish a dichotomy theorem for the complexity of homomorphisms to fixed locally semicomplete digraphs. It is also shown that the same dichotomy holds for list homomorphisms. The polynomial algorithms follow from a different, shorter proof of a result by Gutjahr, Welzl and Woeginger
The Dichotomy Conjecture for constraint satisfaction problems (CSPs) states that every CSP is in P o...
Recently, Huang (1995) gave a characterization of local tournaments. His characterization involves a...
Recently, Huang (1995) gave a characterization of local tournaments. His characterization involves a...
AbstractIn this paper we establish a dichotomy theorem for the complexity of homomorphisms to fixed ...
In this paper we give a graph theoretic proof of the fact that deciding whether a homomorphism exist...
In this paper we give a graph theoretic proof of the fact that deciding whether a homomorphism exist...
For digraphs D and H, a mapping f:V(D)→V(H) is a homomorphism of D to H if uvA(D) implies f(u)f(v)A(...
For digraphs D and H, a mapping f:V(D)→V(H) is a homomorphism of D to H if uvA(D) implies f(u)f(v)A(...
For digraphs D and H, a mapping f:V(D)→V(H) is a homomorphism of D to H if uvA(D) implies f(u)f(v)A(...
For digraphs D and H, a mapping f:V(D)→V(H) is a homomorphism of D to H if uvA(D) implies f(u)f(v)A(...
For digraphs D and H, a mapping f:V(D)→V(H) is a homomorphism of D to H if uvA(D) implies f(u)f(v)A(...
AbstractFor digraphs D and H, a mapping f:V(D)→V(H) is a homomorphism of D to H if uv∈A(D) implies f...
AbstractLet H be a fixed undirected graph. An H-colouring of an undirected graph G is a homomorphism...
Recently, Huang (1995) gave a characterization of local tournaments. His characterization involves a...
The Dichotomy Conjecture for constraint satisfaction problems (CSPs) states that every CSP is in P o...
The Dichotomy Conjecture for constraint satisfaction problems (CSPs) states that every CSP is in P o...
Recently, Huang (1995) gave a characterization of local tournaments. His characterization involves a...
Recently, Huang (1995) gave a characterization of local tournaments. His characterization involves a...
AbstractIn this paper we establish a dichotomy theorem for the complexity of homomorphisms to fixed ...
In this paper we give a graph theoretic proof of the fact that deciding whether a homomorphism exist...
In this paper we give a graph theoretic proof of the fact that deciding whether a homomorphism exist...
For digraphs D and H, a mapping f:V(D)→V(H) is a homomorphism of D to H if uvA(D) implies f(u)f(v)A(...
For digraphs D and H, a mapping f:V(D)→V(H) is a homomorphism of D to H if uvA(D) implies f(u)f(v)A(...
For digraphs D and H, a mapping f:V(D)→V(H) is a homomorphism of D to H if uvA(D) implies f(u)f(v)A(...
For digraphs D and H, a mapping f:V(D)→V(H) is a homomorphism of D to H if uvA(D) implies f(u)f(v)A(...
For digraphs D and H, a mapping f:V(D)→V(H) is a homomorphism of D to H if uvA(D) implies f(u)f(v)A(...
AbstractFor digraphs D and H, a mapping f:V(D)→V(H) is a homomorphism of D to H if uv∈A(D) implies f...
AbstractLet H be a fixed undirected graph. An H-colouring of an undirected graph G is a homomorphism...
Recently, Huang (1995) gave a characterization of local tournaments. His characterization involves a...
The Dichotomy Conjecture for constraint satisfaction problems (CSPs) states that every CSP is in P o...
The Dichotomy Conjecture for constraint satisfaction problems (CSPs) states that every CSP is in P o...
Recently, Huang (1995) gave a characterization of local tournaments. His characterization involves a...
Recently, Huang (1995) gave a characterization of local tournaments. His characterization involves a...
DOI
Add to ORKG