"Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism ..."

Florent Foucaud et al. (2019)
a service of Schloss Dagstuhl - Leibniz Center for Informatics