3 citations · 5 across the 5 of their papers we have counts for
6 papers
The forced colouring function of a graph
G. E. Farr
The forced colouring function of a graph gives the probability that a random assignment of colours to a random subset of vertices can be extended, by a simple local process called…
Dominic Welsh: his work and influence
Graham Farr, Dillon Mayhew, James Oxley
We review the work of Dominic Welsh (1938-2023), tracing his remarkable influence through his theorems, expository writing, students, and interactions. He was particularly adept at…
Graph polynomials: some questions on the edge
Graham Farr, Kerri Morgan
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly o…
Anytime Approximate Formal Feature Attribution
Jinqiang Yu, Graham Farr, Alexey Ignatiev +1
Widespread use of artificial intelligence (AI) algorithms and machine learning (ML) models on the one hand and a number of crucial issues pertaining to them warrant the need for ex…
Binary functions, degeneracy, and alternating dimaps
G. E. Farr
This paper continues the study of combinatorial properties of binary functions --- that is, functions such that , where is a finite…
Minors for alternating dimaps
G. E. Farr
We develop a theory of minors for alternating dimaps --- orientably embedded digraphs where, at each vertex, the incident edges (taken in the order given by the embedding) are dire…