A Correlation Inequality Involving Stable Set and Chromatic Polynomials. - G. E. Farr (J. Comb. Theory B, 1993)

The Complexity of Strict Minimum Message Length Inference. - G. E. Farr; Chris S. Wallace (Comput. J., 2002)

The Go polynomials of a graph. - G. E. Farr (Theor. Comput. Sci., 2003)

The Complexity of Counting Colourings of Subgraphs of the Grid. - G. E. Farr (Comb. Probab. Comput., 2006)

On the Ashkin-Teller Model and Tutte-Whitney Functions. - G. E. Farr (Comb. Probab. Comput., 2007)

Binary functions, degeneracy, and alternating dimaps. - G. E. Farr (Discret. Math., 2019)