| 2008 |
|---|
| 12 | EE | Keith Edwards,
Graham Farr:
Planarization and fragmentability of some classes of graphs.
Discrete Mathematics 308(12): 2396-2406 (2008) |
| 11 | EE | Graham Farr,
Johannes Schmidt:
On the number of Go positions on lattice graphs.
Inf. Process. Lett. 105(4): 124-130 (2008) |
| 2007 |
|---|
| 10 | EE | Kerri Morgan,
Graham Farr:
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems.
J. Graph Algorithms Appl. 11(1): 165-193 (2007) |
| 2006 |
|---|
| 9 | EE | Suan Khai Chong,
Graham Farr,
Laura Frost,
Simon Hawley:
On pedagogically sound examples in public-key cryptography.
ACSC 2006: 63-68 |
| 2005 |
|---|
| 8 | EE | Keith Edwards,
Graham Farr:
On monochromatic component size for improper colourings.
Discrete Applied Mathematics 148(1): 89-105 (2005) |
| 2003 |
|---|
| 7 | EE | Graham Farr,
Peter Eades:
Skewness of Graphs with Small Cutsets.
Graphs and Combinatorics 19(2): 177-194 (2003) |
| 2001 |
|---|
| 6 | EE | Keith Edwards,
Graham Farr:
An Algorithm for Finding Large Induced Planar Subgraphs.
Graph Drawing 2001: 75-83 |
| 5 | EE | Keith Edwards,
Graham Farr:
Fragmentability of Graphs.
J. Comb. Theory, Ser. B 82(1): 30-37 (2001) |
| 1994 |
|---|
| 4 | | Graham Farr:
On Problems with Short Certificates.
Acta Inf. 31(5): 479-502 (1994) |
| 1988 |
|---|
| 3 | EE | Graham Farr:
The complexity of multicolouring.
Discrete Mathematics 69(3): 219-223 (1988) |
| 2 | EE | Graham Farr:
The subgraph homeomorphism problem for small wheels.
Discrete Mathematics 71(2): 129-142 (1988) |
| 1985 |
|---|
| 1 | | Graham Farr,
Colin McDiarmid:
The Compexity of Counting Homeomorphs.
Theor. Comput. Sci. 36: 345-348 (1985) |
