Graham Farr - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2021

Non-Separating Planar GraphsHooman Reisi Dehkordi, Graham Farr. combinatorics, 28(1):1, 2021. [doi]

On the Strong Hanani-Tutte TheoremHooman Reisi Dehkordi, Graham Farr. combinatorics, 28(1):1, 2021. [doi]

Factorisation of Greedoid Polynomials of Rooted DigraphsKai Siong Yow, Kerri Morgan, Graham Farr. gc, 37(6):2245-2264, 2021. [doi]

2019

Short certificates for chromatic equivalenceZoe Bukovac, Graham Farr, Kerri Morgan. jgaa, 23(2):227-269, 2019. [doi]

Using Go in teaching the theory of computationGraham Farr. sigact, 50(1):65-78, 2019. [doi]

2018

The Sprague-Grundy function for some nearly disjunctive sums of Nim and Silver Dollar gamesGraham Farr, Nhan Bao Ho. TCS, 732:46-59, 2018. [doi]

2016

Computer History on the MoveGraham Farr, A. Barbara Ainsworth, Chris Avram, Judy Sheard. sigcse 2016: 528-533 [doi]

2015

Cost-effectiveness of algorithmsGraham Farr. dmtcs, 17(1):201-218, 2015. [doi]

2014

Certificates for Properties of Stability Polynomials of GraphsRanjie Mo, Graham Farr, Kerri Morgan. combinatorics, 21(1):1, 2014. [doi]

Graphs with no 7-wheel subdivisionRebecca Robinson, Graham Farr. DM, 327:9-28, 2014. [doi]

2012

Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded GraphsKeith Edwards, Graham Farr. combinatorics, 19(2):25, 2012. [doi]

Non-bipartite chromatic factorsKerri Morgan, Graham Farr. DM, 312(6):1166-1170, 2012. [doi]

2009

Certificates of Factorisation for a Class of Triangle-Free GraphsKerri Morgan, Graham Farr. combinatorics, 16(1), 2009. [doi]

Certificates of Factorisation for Chromatic PolynomialsKerri Morgan, Graham Farr. combinatorics, 16(1), 2009. [doi]

Structure and Recognition of Graphs with No 6-wheel SubdivisionRebecca Robinson, Graham Farr. algorithmica, 55(4):703-728, 2009. [doi]

2008

On the number of Go positions on lattice graphsGraham Farr, Johannes Schmidt. ipl, 105(4):124-130, 2008. [doi]

2007

Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph ProblemsKerri Morgan, Graham Farr. jgaa, 11(1):165-193, 2007. [doi]

2006

On pedagogically sound examples in public-key cryptographySuan Khai Chong, Graham Farr, Laura Frost, Simon Hawley. acsc 2006: 63-68 [doi]

2005

On monochromatic component size for improper colouringsKeith Edwards, Graham Farr. DAM, 148(1):89-105, 2005. [doi]

2004

Some results on generalised Whitney functionsGraham Farr. aam, 32(1-2):239-262, 2004. [doi]

2003

Skewness of Graphs with Small CutsetsGraham Farr, Peter Eades. gc, 19(2):177-194, 2003. [doi]

2001

Fragmentability of GraphsKeith Edwards, Graham Farr. JCT, 82(1):30-37, 2001. [doi]

An Algorithm for Finding Large Induced Planar SubgraphsKeith Edwards, Graham Farr. gd 2002: 75-83 [doi]

1994

On Problems with Short CertificatesGraham Farr. ACTA, 31(5):479-502, 1994.

1988

The subgraph homeomorphism problem for small wheelsGraham Farr. DM, 71(2):129-142, 1988. [doi]

The complexity of multicolouringGraham Farr. DM, 69(3):219-223, 1988. [doi]

1985

The Compexity of Counting HomeomorphsGraham Farr, Colin McDiarmid. TCS, 36:345-348, 1985.

Sign in or sign up to see more results.

runs on WebDSL