19972019
If you made any changes in Pure these will be visible here soon.

Research Output 1997 2019

Filter
Article
2019

Binary functions, degeneracy, and alternating dimaps

Farr, G. E., 22 Feb 2019, In : Discrete Mathematics. 342, 5, p. 1510-1519 10 p.

Research output: Contribution to journalArticleResearchpeer-review

Using Go in teaching the theory of computation

Farr, G. E., Mar 2019, In : SIGACT News. 50, 1, p. 65-78 14 p.

Research output: Contribution to journalArticleResearch

2018

Minors for alternating dimaps

Farr, G. E., 1 Mar 2018, In : Quarterly Journal of Mathematics. 69, 1, p. 285-320 36 p.

Research output: Contribution to journalArticleResearchpeer-review

Powerful sets: a generalisation of binary matroids

Farr, G. E. & Wang, A. Y. Z., 7 Sep 2018, In : The Electronic Journal of Combinatorics. 25, 3, p. 1-20 20 p., #P3.42.

Research output: Contribution to journalArticleResearchpeer-review

Open Access
File

The Sprague–Grundy function for some nearly disjunctive sums of NIM and SILVER DOLLAR games

Farr, G. & Ho, N. B., 7 Jul 2018, In : Theoretical Computer Science. 732, p. 46-59 14 p.

Research output: Contribution to journalArticleResearchpeer-review

2017

The probabilistic method meets go

Farr, G., 2017, In : Journal of the Korean Mathematical Society. 54, 4, p. 1121-1148 28 p.

Research output: Contribution to journalArticleResearchpeer-review

2015

Cost-effectiveness of algorithms

Farr, G. E., 2015, In : Discrete Mathematics and Theoretical Computer Science. 17, 1, p. 201 - 218 18 p.

Research output: Contribution to journalArticleResearchpeer-review

Open Access
File
2014

Certificates for properties of stability polynomials of graphs

Mo, R., Farr, G. E. & Morgan, K. J-A., 2014, In : The Electronic Journal of Combinatorics. 21, 1, p. 1 - 25 25 p.

Research output: Contribution to journalArticleResearchpeer-review

Open Access

Graphs with no 7-wheel subdivision

Robinson, R. J. & Farr, G. E., 2014, In : Discrete Mathematics. 327, p. 9 - 28 20 p.

Research output: Contribution to journalArticleResearchpeer-review

2013

Transforms and minors for binary functions

Farr, G. E., 2013, In : Annals of Combinatorics. 17, 3, p. 477 - 493 17 p.

Research output: Contribution to journalArticleResearchpeer-review

2012

Improved upper bounds for planarization and series-parallelization of degree-bounded graphs

Edwards, K. J. & Farr, G. E., 2012, In : The Electronic Journal of Combinatorics. 19, 2, p. 1 - 19 19 p.

Research output: Contribution to journalArticleResearchpeer-review

Open Access
File

Non-bipartite chromatic factors

Morgan, K. J-A. & Farr, G. E., 2012, In : Discrete Mathematics. 312, 6, p. 1166 - 1170 5 p.

Research output: Contribution to journalArticleResearchpeer-review

2010

Eigencircles and associated surfaces

Englefield, M. & Farr, G., 2010, In : Mathematical Gazette. 94, 531, p. 438 - 449 12 p.

Research output: Contribution to journalArticleResearchpeer-review

2009

Certificates of factorisation for a class of triangle-free graphs

Morgan, K. J-A. & Farr, G. E., 2009, In : The Electronic Journal of Combinatorics. 16, 1, p. 1 - 14 14 p.

Research output: Contribution to journalArticleResearchpeer-review

Certificates of factorisation for chromatic polynomials

Morgan, K. J-A. & Farr, G. E., 2009, In : The Electronic Journal of Combinatorics. 16, 1, p. 1 - 29 29 p.

Research output: Contribution to journalArticleResearchpeer-review

Structure and recognition of graphs with no 6-wheel subdivision

Robinson, R. J. & Farr, G. E., 2009, In : Algorithmica. 55, 4, p. 703 - 728 26 p.

Research output: Contribution to journalArticleResearchpeer-review

2008

On the number of Go positions on lattice graphs

Farr, G. E. & Schmidt, J., 2008, In : Information Processing Letters. 105, 4, p. 124 - 130 7 p.

Research output: Contribution to journalArticleResearchpeer-review

Planarization and fragmentability of some classes of graphs

Edwards, K. J. & Farr, G. E., 2008, In : Discrete Mathematics. 308, 12, p. 2396 - 2406 11 p.

Research output: Contribution to journalArticleResearchpeer-review

2007

Approximation algorithms for the maximum induced planar and outerplanar subgraph problems

Morgan, K. J-A. & Farr, G. E., 2007, In : Journal of Graph Algorithms and Applications. 11, 1, p. 165 - 193 29 p.

Research output: Contribution to journalArticleResearchpeer-review

On the Ashkin-Teller model and Tutte-Whitney functions

Farr, G. E., 2007, In : Combinatorics, Probability and Computing. 16, 2, p. 251 - 260 10 p.

Research output: Contribution to journalArticleResearchpeer-review

2006

Eigencircles of 2 x 2 matrices

Englefield, M. J. & Farr, G. E., 2006, In : Mathematics Magazine. 79, 4, p. 281 - 289 9 p.

Research output: Contribution to journalArticleResearchpeer-review

The complexity of counting colourings of subgraphs of the grid

Farr, G. E., 2006, In : Combinatorics, Probability and Computing. 15, 3, p. 377 - 383 7 p.

Research output: Contribution to journalArticleResearchpeer-review

2005

On monochromatic component size for improper colourings

Edwards, K. & Farr, G. E., 2005, In : Discrete Applied Mathematics. 148, 1, p. 89 - 105 17 p.

Research output: Contribution to journalArticleResearchpeer-review

2004

Some results on generalised Whitney functions

Farr, G. E., 2004, In : Advances in Applied Mathematics. 32, p. 239 - 262 24 p.

Research output: Contribution to journalArticleResearchpeer-review

2003

Skewness of graphs with small cutsets

Farr, G. E. & Eades, P., 2003, In : Graphs and Combinatorics. 19, 2, p. 177 - 194 18 p.

Research output: Contribution to journalArticleResearchpeer-review

The Go polynomials of a graph

Farr, G. E., 2003, In : Theoretical Computer Science. 306, 1-3, p. 1 - 18 18 p.

Research output: Contribution to journalArticleResearchpeer-review

2002

An algorithm for finding large induced planar subgraphs

Edwards, K. & Farr, G. E., 2002, In : Lecture Notes in Computer Science. 2265, p. 75 - 83 9 p.

Research output: Contribution to journalArticleResearchpeer-review

The complexity of strict Minimum Message Length inference

Farr, G. E. & Wallace, C. S., 2002, In : Computer Journal. 45, 3, p. 285 - 292 8 p.

Research output: Contribution to journalArticleResearchpeer-review

2001

Fragmentability of graphs

Edwards, K. & Farr, G. E., 2001, In : Journal of Combinatorial Theory. Series B. 82, 1, p. 30 - 37 8 p.

Research output: Contribution to journalArticleResearchpeer-review

2000

Inductive Inference of Chess Player Strategy

Jansen, A. R., Dowe, D. L. & Farr, G. E., 2000, In : Lecture Notes in Computer Science. p. 61 - 71 11 p.

Research output: Contribution to journalArticleResearchpeer-review

1999

Unsupervised Learning in Metagame

Farr, G. E. & Powell, D. R., 1999, In : Lecture Notes in Computer Science. p. 24 - 35 12 p.

Research output: Contribution to journalArticleResearchpeer-review