Recolouring Graphs: Decompositions, A Dichotomy Theorem and Frozen   Colourings Speaker: Kathie Cameron, Wilfrid Laurier University A k-colouring of a graph G is an assignment of at most k colours to the vertices of a graph so that the ends of each edge of the graph