Copy and paste this link:
http://journals.cambridge.org/action/displayAbstract?aid=425849
Copy and paste this citation
G. E. FARR
(2006).
The Complexity of Counting Colourings of Subgraphs of the Grid. Combinatorics, Probability and Computing, 15
,
pp 377-383
doi:10.1017/S0963548305007364