Back to matchesWe found a matchYour institution may have access to this item. Find your institution then sign in to continue.TitleThe complexity of counting graph homomorphisms.AuthorsDyer, Martin; Greenhill, CatherinePublicationRandom Structures & Algorithms, 2000, Vol 17, Issue 3/4, p260ISSN1042-9832Publication typeArticleDOI10.1002/1098-2418(200010/12)17:3/4<260::AID-RSA5>3.0.CO;2-W