Counting homomorphisms to K4-minor-free graphs, modulo 2
We study the problem of computing the parity of the number of homomorphisms from an input graph $G$ to a fixed graph $H$. Faben and Jerrum [Theory Comput., 11 (2015), pp. 35--57] introduced an explicit criterion on the graph $H$ and conjectured that, if satisfied, the problem is solvable in polynomi...
| Huvudupphovsmän: | , , , |
|---|---|
| Materialtyp: | Journal article |
| Språk: | English |
| Publicerad: |
Society for Industrial and Applied Mathematics
2021
|