G. E. Farr

	2007
5		G. E. Farr: On the Ashkin-Teller Model and Tutte-Whitney Functions. Combinatorics, Probability & Computing 16(2): 251-260 (2007)
	2006
4		G. E. Farr: The Complexity of Counting Colourings of Subgraphs of the Grid. Combinatorics, Probability & Computing 15(3): 377-383 (2006)
	2003
3		G. E. Farr: The Go polynomials of a graph. Theor. Comput. Sci. 306(1-3): 1-18 (2003)
	2002
2		G. E. Farr, Chris S. Wallace: The Complexity of Strict Minimum Message Length Inference. Comput. J. 45(3): 285-292 (2002)
	1993
1		G. E. Farr: A Correlation Inequality Involving Stable Set and Chromatic Polynomials. J. Comb. Theory, Ser. B 58(1): 14-21 (1993)

Coauthor Index

1

Chris S. Wallace

[2]