4 citations · 8 across the 9 of their papers we have counts for
1 paper · 2 filters
Tim Seppelt, Gian Luca Spitzer
Homomorphism indistinguishability is a way of characterising many natural equivalence relations on graphs. Two graphs G and H are called homomorphism indistinguishable over a g…