Monash University
wilson_thesis_revise_v2 (1)_Redacted.pdf (1 MB)
Download file

Anagram-free Graph Colouring and Colour Schemes

Download (1 MB)
posted on 2019-02-26, 00:10 authored by TIMOTHY EDWARD WILSON
Graphs model the connectivity of networks, and many researchers study how to colour the nodes of a graph under various restrictions. Anagram-free colouring is a type of graph colouring which requires the first half of every path through a graph to not be a permutation of the second half. This thesis answers questions about the number of colours required to anagram-free colour many types of graphs. It also studies anagram-free colouring in a wider context by introducing colour schemes, an axiomatic approach that unifies known types of graph colouring.


Principal supervisor

David Wood

Year of Award


Department, School or Centre

Mathematical Sciences


Doctor of Philosophy

Degree Type



Faculty of Science