On a Lovász-type lemma, applied to Brooks’ theorem for list-colouring

In this paper, I present a new structural lemma for k -regular graphs, similar to an earlier lemma by Lovász (1975) [5]. The new lemma is then used to give an algebraic proof of Brooks’ theorem for list-colouring.