3 citations · 5 across the 5 of their papers we have counts for
1 paper · 1 filter
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…