78 citations · 97 across the 5 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014
On the complexity of -coloring for special oriented trees
Jakub Bulín
For a fixed digraph , the -coloring problem is the problem of deciding whether a given input digraph admits a homomorphism to . The CSP…
cs.CC2014★ 19 cited
A finer reduction of constraint problems to digraphs
Jakub Bulín, Dejan Delic, Marcel Jackson +1
It is well known that the constraint satisfaction problem over a general relational structure A is polynomial time equivalent to the constraint problem over some associated digraph…