default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraham Farr
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Hooman Reisi Dehkordi, Graham Farr:
Thrackles, Superthrackles and the Hanani-Tutte Theorem. J. Graph Algorithms Appl. 28(1): 95-127 (2024)- [c4]Jinqiang Yu, Graham Farr, Alexey Ignatiev, Peter J. Stuckey:
Anytime Approximate Formal Feature Attribution. SAT 2024: 30:1-30:23 - [i9]Graham Farr, Kerri Morgan:
Graph polynomials: some questions on the edge. CoRR abs/2406.15746 (2024) - [i8]Graham Farr, Dillon Mayhew, James G. Oxley:
Dominic Welsh: his work and influence. CoRR abs/2407.18974 (2024) - 2023
- [i7]Jinqiang Yu, Graham Farr, Alexey Ignatiev
, Peter J. Stuckey:
Anytime Approximate Formal Feature Attribution. CoRR abs/2312.06973 (2023) - 2021
- [j25]Hooman Reisi Dehkordi, Graham Farr:
Non-Separating Planar Graphs. Electron. J. Comb. 28(1): 1 (2021) - [j24]Hooman Reisi Dehkordi, Graham Farr:
On the Strong Hanani-Tutte Theorem. Electron. J. Comb. 28(1): 1 (2021) - [j23]Kai Siong Yow, Kerri Morgan, Graham Farr:
Factorisation of Greedoid Polynomials of Rooted Digraphs. Graphs Comb. 37(6): 2245-2264 (2021) - 2020
- [i6]Srinibas Swain, C. Paul Bonnington, Graham Farr, Kerri Morgan:
A survey of repositories in graph theory. CoRR abs/2006.12741 (2020)
2010 – 2019
- 2019
- [j22]Zoë Bukovac, Graham Farr, Kerri Morgan:
Short certificates for chromatic equivalence. J. Graph Algorithms Appl. 23(2): 227-269 (2019) - [j21]Graham Farr:
Using Go in teaching the theory of computation. SIGACT News 50(1): 65-78 (2019) - 2018
- [j20]Graham Farr, Nhan Bao Ho:
The Sprague-Grundy function for some nearly disjunctive sums of Nim and Silver Dollar games. Theor. Comput. Sci. 732: 46-59 (2018) - [i5]Kai Siong Yow, Graham Farr, Kerri Morgan:
Tutte Invariants for Alternating Dimaps. CoRR abs/1803.05539 (2018) - [i4]Kai Siong Yow, Kerri Morgan, Graham Farr:
Factorisation of Greedoid Polynomials of Rooted Digraphs. CoRR abs/1809.02924 (2018) - 2017
- [i3]Rebecca Robinson, Graham Farr:
Topological containment of the 5-clique minus an edge in 4-connected graphs. CoRR abs/1705.01224 (2017) - 2016
- [c3]Graham Farr, A. Barbara Ainsworth, Chris Avram, Judy Sheard:
Computer History on the Move. SIGCSE 2016: 528-533 - 2015
- [j19]Graham Farr:
Cost-effectiveness of algorithms. Discret. Math. Theor. Comput. Sci. 17(1): 201-218 (2015) - 2014
- [j18]Ranjie Mo, Graham Farr, Kerri Morgan:
Certificates for Properties of Stability Polynomials of Graphs. Electron. J. Comb. 21(1): 1 (2014) - [j17]Rebecca Robinson, Graham Farr:
Graphs with no 7-wheel subdivision. Discret. Math. 327: 9-28 (2014) - 2013
- [i2]Rebecca Robinson, Graham Farr:
Graphs with no 7-wheel subdivision. CoRR abs/1311.0573 (2013) - [i1]Rebecca Robinson, Graham Farr:
Search strategies for developing characterizations of graphs without small wheel subdivisions. CoRR abs/1311.0574 (2013) - 2012
- [j16]Keith Edwards, Graham Farr:
Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs. Electron. J. Comb. 19(2): 25 (2012) - [j15]Kerri Morgan, Graham Farr:
Non-bipartite chromatic factors. Discret. Math. 312(6): 1166-1170 (2012)
2000 – 2009
- 2009
- [j14]Rebecca Robinson, Graham Farr:
Structure and Recognition of Graphs with No 6-wheel Subdivision. Algorithmica 55(4): 703-728 (2009) - [j13]Kerri Morgan, Graham Farr:
Certificates of Factorisation for Chromatic Polynomials. Electron. J. Comb. 16(1) (2009) - [j12]Kerri Morgan, Graham Farr:
Certificates of Factorisation for a Class of Triangle-Free Graphs. Electron. J. Comb. 16(1) (2009) - 2008
- [j11]Keith Edwards, Graham Farr:
Planarization and fragmentability of some classes of graphs. Discret. Math. 308(12): 2396-2406 (2008) - [j10]Graham Farr, Johannes Schmidt:
On the number of Go positions on lattice graphs. Inf. Process. Lett. 105(4): 124-130 (2008) - 2007
- [j9]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
- [c2]Suan Khai Chong, Graham Farr, Laura Frost, Simon Hawley:
On pedagogically sound examples in public-key cryptography. ACSC 2006: 63-68 - 2005
- [j8]Keith Edwards, Graham Farr:
On monochromatic component size for improper colourings. Discret. Appl. Math. 148(1): 89-105 (2005) - 2004
- [j7]Graham Farr:
Some results on generalised Whitney functions. Adv. Appl. Math. 32(1-2): 239-262 (2004) - 2003
- [j6]Graham Farr, Peter Eades:
Skewness of Graphs with Small Cutsets. Graphs Comb. 19(2): 177-194 (2003) - 2001
- [j5]Keith Edwards, Graham Farr:
Fragmentability of Graphs. J. Comb. Theory B 82(1): 30-37 (2001) - [c1]Keith Edwards, Graham Farr:
An Algorithm for Finding Large Induced Planar Subgraphs. GD 2001: 75-83
1990 – 1999
- 1994
- [j4]Graham Farr:
On Problems with Short Certificates. Acta Informatica 31(5): 479-502 (1994)
1980 – 1989
- 1988
- [j3]Graham Farr:
The complexity of multicolouring. Discret. Math. 69(3): 219-223 (1988) - [j2]Graham Farr:
The subgraph homeomorphism problem for small wheels. Discret. Math. 71(2): 129-142 (1988) - 1985
- [j1]Graham Farr, Colin McDiarmid:
The Compexity of Counting Homeomorphs. Theor. Comput. Sci. 36: 345-348 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
