Is there any software that, given two graphs $G$ and $H$, can compute all graph homomorphisms from $G$ to $H$?
I found this rather old question, but it does not seem to answer my query.
It could be still interesting for some particular classes of graphs, like complete bipartite, and so on (except complete graphs, which is easy in terms of permutations of vertices).