The Compexity of Counting Homeomorphs. - Graham Farr; Colin McDiarmid (Theor. Comput. Sci., 1985)

The complexity of multicolouring. - Graham Farr (Discret. Math., 1988)

The subgraph homeomorphism problem for small wheels. - Graham Farr (Discret. Math., 1988)

On Problems with Short Certificates. - Graham Farr (Acta Informatica, 1994)

An Algorithm for Finding Large Induced Planar Subgraphs. - Keith Edwards; Graham Farr (GD, 2001)

Fragmentability of Graphs. - Keith Edwards; Graham Farr (J. Comb. Theory B, 2001)

Skewness of Graphs with Small Cutsets. - Graham Farr; Peter Eades (Graphs Comb., 2003)

Some results on generalised Whitney functions. - Graham Farr (Adv. Appl. Math., 2004)

On monochromatic component size for improper colourings. - Keith Edwards; Graham Farr (Discret. Appl. Math., 2005)

On pedagogically sound examples in public-key cryptography. - Suan Khai Chong; Graham Farr; Laura Frost; Simon Hawley (ACSC, 2006)

Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems. - Kerri Morgan; Graham Farr (J. Graph Algorithms Appl., 2007)

Planarization and fragmentability of some classes of graphs. - Keith Edwards; Graham Farr (Discret. Math., 2008)

On the number of Go positions on lattice graphs. - Graham Farr; Johannes Schmidt 002 (Inf. Process. Lett., 2008)

Structure and Recognition of Graphs with No 6-wheel Subdivision. - Rebecca Robinson; Graham Farr (Algorithmica, 2009)

Certificates of Factorisation for Chromatic Polynomials. - Kerri Morgan; Graham Farr (Electron. J. Comb., 2009)

Certificates of Factorisation for a Class of Triangle-Free Graphs. - Kerri Morgan; Graham Farr (Electron. J. Comb., 2009)

Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs. - Keith Edwards; Graham Farr (Electron. J. Comb., 2012)

Non-bipartite chromatic factors. - Kerri Morgan; Graham Farr (Discret. Math., 2012)

Search strategies for developing characterizations of graphs without small wheel subdivisions. - Rebecca Robinson; Graham Farr (CoRR, 2013)

Certificates for Properties of Stability Polynomials of Graphs. - Ranjie Mo; Graham Farr; Kerri Morgan (Electron. J. Comb., 2014)

Graphs with no 7-wheel subdivision. - Rebecca Robinson; Graham Farr (Discret. Math., 2014)

Cost-effectiveness of algorithms. - Graham Farr (Discret. Math. Theor. Comput. Sci., 2015)

Computer History on the Move. - Graham Farr; A. Barbara Ainsworth; Chris Avram; Judy Sheard (SIGCSE, 2016)

Topological containment of the 5-clique minus an edge in 4-connected graphs. - Rebecca Robinson; Graham Farr (CoRR, 2017)

Tutte Invariants for Alternating Dimaps. - Kai Siong Yow; Graham Farr; Kerri Morgan (CoRR, 2018)

The Sprague-Grundy function for some nearly disjunctive sums of Nim and Silver Dollar games. - Graham Farr; Nhan Bao Ho (Theor. Comput. Sci., 2018)

Short certificates for chromatic equivalence. - Zoë Bukovac; Graham Farr; Kerri Morgan (J. Graph Algorithms Appl., 2019)

Using Go in teaching the theory of computation. - Graham Farr (SIGACT News, 2019)

A survey of repositories in graph theory. - Srinibas Swain; C. Paul Bonnington; Graham Farr; Kerri Morgan (CoRR, 2020)

Non-Separating Planar Graphs. - Hooman Reisi Dehkordi; Graham Farr (Electron. J. Comb., 2021)

On the Strong Hanani-Tutte Theorem. - Hooman Reisi Dehkordi; Graham Farr (Electron. J. Comb., 2021)

Factorisation of Greedoid Polynomials of Rooted Digraphs. - Kai Siong Yow; Kerri Morgan; Graham Farr (Graphs Comb., 2021)

Anytime Approximate Formal Feature Attribution. - Jinqiang Yu; Graham Farr; Alexey Ignatiev; Peter J. Stuckey (SAT, 2024)

Graph polynomials: some questions on the edge. - Graham Farr; Kerri Morgan (CoRR, 2024)

Dominic Welsh: his work and influence. - Graham Farr; Dillon Mayhew; James G. Oxley (CoRR, 2024)

Thrackles, Superthrackles and the Hanani-Tutte Theorem. - Hooman Reisi Dehkordi; Graham Farr (J. Graph Algorithms Appl., 2024)