Martin E. Dyer, Catherine S. Greenhill. Corrigendum: The complexity of counting graph homomorphisms. Random Struct. Algorithms, 25(3):346-352, 2004. [doi]
@article{DyerG04,
title = {Corrigendum: The complexity of counting graph homomorphisms},
author = {Martin E. Dyer and Catherine S. Greenhill},
year = {2004},
doi = {10.1002/rsa.20036},
url = {http://dx.doi.org/10.1002/rsa.20036},
tags = {graph-rewriting, e-science, rewriting},
researchr = {https://researchr.org/publication/DyerG04},
cites = {0},
citedby = {0},
journal = {Random Struct. Algorithms},
volume = {25},
number = {3},
pages = {346-352},
}