Corrigendum: The complexity of counting graph homomorphisms
| Image |  |
|---|---|
| Description | scholarly article by Martin Dyer & Catherine Greenhill published 2004 in Random Structures and Algorithms |
| Author/s |
author: Martin Dyer Catherine Greenhill |
| Publication date | 2004 |
| Language | |
| Country of origin | |
| Wikipedia link | |
| Copyright status | |
| Missing/wrong data? | Edit Wikidata item |