Corrigendum: The complexity of counting graph homomorphisms

DOI10.1002/RSA.20036zbMATH Open1089.68076OpenAlexW2141321698WikidataQ56323935 ScholiaQ56323935MaRDI QIDQ3159461FDOQ3159461

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 (11)

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

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)