1 paper · 1 filter
Josse van Dobben de Bruyn, Jérémie Marquès, David E. Roberson +3
Two graphs G and H are homomorphism indistinguishable over a graph class F if, for every graph F∈F, the number of homomorphisms from F to G is e…