3 citations · 4 across the 10 of their papers we have counts for
1 paper · 1 filter
Sally Cockburn
A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the…