Corrigendum: The complexity of counting graph homomorphisms

DOI10.1002/RSA.20036MaRDI QIDQ3159461zbMATH OpenOpenAlexWikidataFDO

Authors Martin Dyer, Catherine Greenhill

Publication date 16 February 2005

Published in Random Structures \& Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Cited in

(12)

• Corrigendum to: `Complexity of diagrams'
• The complexity of approximating bounded-degree Boolean \(\#\)CSP
• From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems
• Correction to: ``On the expressive power of linear algebra on graphs
• A dichotomy for real weighted Holant problems
• A dichotomy for bounded degree graph homomorphisms with nonnegative weights
• scientific article; zbMATH DE number 4066342 (Why is no real title available?)
• A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems
• Perfect matchings, rank of connection tensors and graph homomorphisms
• Corrigendum to: ``Complexity and approximability of the happy set problem
• A dichotomy for bounded degree graph homomorphisms with nonnegative weights
• Efficient algorithms for counting parameterized list H-colorings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3159461)