|
|||||
|
|
Corrigendum: The complexity of counting graph homomorphisms |
|
| Authors: | Martin Dyer Catherine Greenhill |
| Abstract: | We close a gap in the proof of Theorem 4.1 in our paper “The complexity of counting graph homomorphisms” [Random Structures Algorithms 17 (2000), 260–289]. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004 |
| Keywords: | |