Counting Homomorphisms to Square-Free Graphs, Modulo 2

DOI10.1007/978-3-662-47672-7_52zbMath1440.68187arXiv1501.07539MaRDI QIDQ3448822

Leslie Ann Goldberg, David Richerby, Andreas Göbel

Publication date: 27 October 2015

Published in: ACM Transactions on Computation Theory, Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.07539

zbMATH Keywords

graph homomorphism; counting modulo 2; parity complexity dichotomy

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C30: Enumeration in graph theory

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)