# Graham Farr

According to our database

Collaborative distances:

^{1}, Graham Farr authored at least 26 papers between 1985 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Using Go in teaching the theory of computation.

SIGACT News, 2019

2018

The Sprague-Grundy function for some nearly disjunctive sums of Nim and Silver Dollar games.

Theor. Comput. Sci., 2018

2017

Topological containment of the 5-clique minus an edge in 4-connected graphs.

CoRR, 2017

2016

Computer History on the Move.

Proceedings of the 47th ACM Technical Symposium on Computing Science Education, Memphis, TN, USA, March 02, 2016

2015

Cost-effectiveness of algorithms.

Discrete Mathematics & Theoretical Computer Science, 2015

2014

Graphs with no 7-wheel subdivision.

Discrete Mathematics, 2014

Certificates for Properties of Stability Polynomials of Graphs.

Electr. J. Comb., 2014

2013

Search strategies for developing characterizations of graphs without small wheel subdivisions.

CoRR, 2013

Graphs with no 7-wheel subdivision.

CoRR, 2013

2012

Non-bipartite chromatic factors.

Discrete Mathematics, 2012

Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs.

Electr. J. Comb., 2012

2009

Certificates of Factorisation for a Class of Triangle-Free Graphs.

Electr. J. Comb., 2009

Certificates of Factorisation for Chromatic Polynomials.

Electr. J. Comb., 2009

Structure and Recognition of Graphs with No 6-wheel Subdivision.

Algorithmica, 2009

2008

On the number of Go positions on lattice graphs.

Inf. Process. Lett., 2008

Planarization and fragmentability of some classes of graphs.

Discrete Mathematics, 2008

2007

Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems.

J. Graph Algorithms Appl., 2007

2006

On pedagogically sound examples in public-key cryptography.

Proceedings of the Computer Science 2006, 2006

2005

On monochromatic component size for improper colourings.

Discrete Applied Mathematics, 2005

2003

Skewness of Graphs with Small Cutsets.

Graphs and Combinatorics, 2003

2001

Fragmentability of Graphs.

J. Comb. Theory, Ser. B, 2001

An Algorithm for Finding Large Induced Planar Subgraphs.

Proceedings of the Graph Drawing, 9th International Symposium, 2001

1994

On Problems with Short Certificates.

Acta Inf., 1994

1988

The subgraph homeomorphism problem for small wheels.

Discrete Mathematics, 1988

The complexity of multicolouring.

Discrete Mathematics, 1988

1985

The Compexity of Counting Homeomorphs.

Theor. Comput. Sci., 1985