The Complexity of Counting Colourings of Subgraphs of the Grid

DOI10.1017/S0963548305007364zbMath1110.68098OpenAlexW2104281821MaRDI QIDQ5479031

Graham E. Farr

Publication date: 6 July 2006

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548305007364

zbMATH Keywords

graphs of bounded tree-width

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Short certificates for chromatic equivalence ⋮ A little statistical mechanics for the graph theorist

This page was built for publication: The Complexity of Counting Colourings of Subgraphs of the Grid