3
$\begingroup$

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).

Improve this question
$\endgroup$
3
  • $\begingroup$ I haven't looked into it, but a quick Google search turned this up: github.com/guojing0/count-graph-homs $\endgroup$ Commented yesterday
  • $\begingroup$ @diracdeltafunk This page appeared as answer in that old question that I linked to my question. Unfortunately, it seems to me that it allows only to count the number of graph homomorphisms but not to provide them. $\endgroup$ Commented yesterday
  • $\begingroup$ I see. It's probably worth looking at the source code to see if the algorithm can be easily modified to return the actual set of homomorphisms. $\endgroup$ Commented yesterday

0

Reset to default

You must log in to answer this question.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.