G. E. Farr

Suggest Changes
Learn More
This paper introduces graph polynomials based on a concept from the game of Go. Suppose that, for each vertex of a graph, we either leave it uncoloured or choose a colour uniformly at random from a(More)
The chromatic polynomial P (G, λ) gives the number of proper colourings of a graph G in at most λ colours. If P (G, λ) = P (H1, λ)P (H2, λ) /P (Kr, λ), then G is said to have a chromatic(More)