19 citations · 23 across the 6 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013★ 1 cited
Distinguishing homomorphisms of infinite graphs
Anthony Bonato, Dejan Delic
We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper -colourings are generalized to…
cs.CC2013
On the reduction of the CSP dichotomy conjecture to digraphs
Jakub Bulin, Dejan Delic, Marcel Jackson +1
It is well known that the constraint satisfaction problem over general relational structures can be reduced in polynomial time to digraphs. We present a simple variant of such a re…