Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
On the complexity of Sandwich Problems for -partitions
Alexey Barsukov, Santiago Guzmán-Pro
We present a structural classification of constraint satisfaction problems (CSP) described by reflexive complete -edge-coloured graphs. In particular, this classification extend…
cs.CC2025
Restricted CSPs and F-free Digraph Algorithmics
Santiago Guzmán-Pro, Barnaby Martin
In recent years, much attention has been placed on the complexity of graph homomorphism problems when the input is restricted to -free and -subgraph-f…