1. G.R. Brightwell and P. Winkler, Graph homomorphisms and phase transitions, CDAM Research Report, LSE-CDAM-97-01, Centre for Discrete and Applicable Mathematics, London School of Economics, October 1997.
2. Martin Dyer, Leslie Ann Goldberg, Catherine Greenhill and Mark Jerrum, On the Relative Complexity of Approximate Counting Problems, Computer Science Research Report CS-RR-370, University of Warwick, February 2000. http://www.dcs.warwick.ac.uk/pub/index.html
3. M. Dyer, A. Frieze and M. Jerrum, On counting independent sets in sparse graphs, Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS’99), IEEE Computer Society Press, 1999, 210–217.
4. M. Dyer and C. Greenhill, The complexity of counting graph homomorphisms (Extended abstract), Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’00), ACM-SIAM 2000, 246–255.
5. R. Fagin, Generalized first-order spectra and polynomial time recognisable sets. In “Complexity of Computation” (R. Karp, ed.), SIAM-AMS Proceedings 7, 1974, 43–73.