Graham Farr

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 17

Top Topics

Projective Invariants

Hermite Transform

Connected Graphs

Wheeled Mobile Robots

Top Venues

Electron. J. Comb.

J. Graph Algorithms Appl.

Publications

Hooman Reisi Dehkordi, Graham Farr
Thrackles, Superthrackles and the Hanani-Tutte Theorem. J. Graph Algorithms Appl. 28 (1) (2024)
Graham Farr, Dillon Mayhew, James G. Oxley
Dominic Welsh: his work and influence. CoRR (2024)
Graham Farr, Kerri Morgan
Graph polynomials: some questions on the edge. CoRR (2024)
Jinqiang Yu, Graham Farr, Alexey Ignatiev, Peter J. Stuckey
Anytime Approximate Formal Feature Attribution. SAT (2024)
Jinqiang Yu, Graham Farr, Alexey Ignatiev, Peter J. Stuckey
Anytime Approximate Formal Feature Attribution. CoRR (2023)
Kai Siong Yow, Kerri Morgan, Graham Farr
Factorisation of Greedoid Polynomials of Rooted Digraphs. Graphs Comb. 37 (6) (2021)
Hooman Reisi Dehkordi, Graham Farr
On the Strong Hanani-Tutte Theorem. Electron. J. Comb. 28 (1) (2021)
Hooman Reisi Dehkordi, Graham Farr
Non-Separating Planar Graphs. Electron. J. Comb. 28 (1) (2021)
Srinibas Swain, C. Paul Bonnington, Graham Farr, Kerri Morgan
A survey of repositories in graph theory. CoRR (2020)
Zoe Bukovac, Graham Farr, Kerri Morgan
Short certificates for chromatic equivalence. J. Graph Algorithms Appl. 23 (2) (2019)
Graham Farr
Using Go in teaching the theory of computation. SIGACT News 50 (1) (2019)
Kai Siong Yow, Graham Farr, Kerri Morgan
Tutte Invariants for Alternating Dimaps. CoRR (2018)
Kai Siong Yow, Kerri Morgan, Graham Farr
Factorisation of Greedoid Polynomials of Rooted Digraphs. CoRR (2018)
Graham Farr, Nhan Bao Ho
The Sprague-Grundy function for some nearly disjunctive sums of Nim and Silver Dollar games. Theor. Comput. Sci. 732 (2018)
Rebecca Robinson, Graham Farr
Topological containment of the 5-clique minus an edge in 4-connected graphs. CoRR (2017)
Graham Farr, A. Barbara Ainsworth, Chris Avram, Judy Sheard
Computer History on the Move. SIGCSE (2016)
Graham Farr
Cost-effectiveness of algorithms. Discret. Math. Theor. Comput. Sci. 17 (1) (2015)
Ranjie Mo, Graham Farr, Kerri Morgan
Certificates for Properties of Stability Polynomials of Graphs. Electron. J. Comb. 21 (1) (2014)
Rebecca Robinson, Graham Farr
Graphs with no 7-wheel subdivision. Discret. Math. 327 (2014)
Rebecca Robinson, Graham Farr
Search strategies for developing characterizations of graphs without small wheel subdivisions. CoRR (2013)
Rebecca Robinson, Graham Farr
Graphs with no 7-wheel subdivision. CoRR (2013)
Keith Edwards, Graham Farr
Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs. Electron. J. Comb. 19 (2) (2012)
Kerri Morgan, Graham Farr
Non-bipartite chromatic factors. Discret. Math. 312 (6) (2012)
Kerri Morgan, Graham Farr
Certificates of Factorisation for a Class of Triangle-Free Graphs. Electron. J. Comb. 16 (1) (2009)
Rebecca Robinson, Graham Farr
Structure and Recognition of Graphs with No 6-wheel Subdivision. Algorithmica 55 (4) (2009)
Kerri Morgan, Graham Farr
Certificates of Factorisation for Chromatic Polynomials. Electron. J. Comb. 16 (1) (2009)
Keith Edwards, Graham Farr
Planarization and fragmentability of some classes of graphs. Discret. Math. 308 (12) (2008)
Graham Farr, Johannes Schmidt
On the number of Go positions on lattice graphs. Inf. Process. Lett. 105 (4) (2008)
Kerri Morgan, Graham Farr
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems. J. Graph Algorithms Appl. 11 (1) (2007)
Suan Khai Chong, Graham Farr, Laura Frost, Simon Hawley
On pedagogically sound examples in public-key cryptography. ACSC (2006)
Keith Edwards, Graham Farr
On monochromatic component size for improper colourings. Discret. Appl. Math. 148 (1) (2005)
Graham Farr
Some results on generalised Whitney functions. Adv. Appl. Math. 32 (1-2) (2004)
Graham Farr, Peter Eades
Skewness of Graphs with Small Cutsets. Graphs Comb. 19 (2) (2003)
Keith Edwards, Graham Farr
Fragmentability of Graphs. J. Comb. Theory, Ser. B 82 (1) (2001)
Keith Edwards, Graham Farr
An Algorithm for Finding Large Induced Planar Subgraphs. Graph Drawing (2001)
Graham Farr
On Problems with Short Certificates. Acta Informatica 31 (5) (1994)
Graham Farr
The subgraph homeomorphism problem for small wheels. Discret. Math. 71 (2) (1988)
Graham Farr
The complexity of multicolouring. Discret. Math. 69 (3) (1988)
Graham Farr, Colin McDiarmid
The Compexity of Counting Homeomorphs. Theor. Comput. Sci. 36 (1985)