G. E. Farr

According to our database, G. E. Farr authored at least 6 papers between 1993 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2019

Binary functions, degeneracy, and alternating dimaps.

G. E. Farr

Discret. Math., 2019

2007

On the Ashkin-Teller Model and Tutte-Whitney Functions.

G. E. Farr

Comb. Probab. Comput., 2007

2006

The Complexity of Counting Colourings of Subgraphs of the Grid.

G. E. Farr

Comb. Probab. Comput., 2006

2003

The Go polynomials of a graph.

G. E. Farr

Theor. Comput. Sci., 2003

2002

The Complexity of Strict Minimum Message Length Inference.

G. E. Farr, Chris S. Wallace

Comput. J., 2002

1993

A Correlation Inequality Involving Stable Set and Chromatic Polynomials.

G. E. Farr

J. Comb. Theory, Ser. B, 1993