2 papers
math.CO2019
Dismantlability, connectedness, and mixing in relational structures
Raimundo Briceño, Andrei Bulatov, Victor Dalmau +1
The Constraint Satisfaction Problem (CSP) and its counting counterpart appears under different guises in many areas of mathematics, computer science, and elsewhere. Its structural…
cs.CC2017
Surjective H-Colouring over Reflexive Digraphs
Benoit Larose, Barnaby Martin, Daniel Paulusma
The Surjective H-Colouring problem is to test if a given graph allows a vertex-surjective homomorphism to a fixed graph H. The complexity of this problem has been well studied for…