Graph colouring is one of the most important and storied subfields of graph theory. Graph colouring consists of partitioning the nodes in a network into pairwise non-adjacent sets called colours. Dr. Postle’s research plan is to develop local versions of the most important graph colouring results where local means that the number of colours available at a node only depends on local parameters. This research will generalize in a far-reaching way the previous results in the area while having more promise for future applications. In addition, Postle will develop distributed efficient algorithms to find such colourings.