Corrigendum: The complexity of counting graph homomorphisms

DOI10.1002/rsa.20036zbMath1089.68076OpenAlexW2141321698WikidataQ56323935 ScholiaQ56323935MaRDI QIDQ3159461

Martin Dyer, Catherine Greenhill

Publication date: 16 February 2005

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20036

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Perfect matchings, rank of connection tensors and graph homomorphisms ⋮ A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems ⋮ The complexity of approximating bounded-degree Boolean \(\#\)CSP ⋮ From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems ⋮ A dichotomy for bounded degree graph homomorphisms with nonnegative weights ⋮ Efficient algorithms for counting parameterized list \(H\)-colorings ⋮ A dichotomy for real weighted Holant problems

This page was built for publication: Corrigendum: The complexity of counting graph homomorphisms