10.26180/5c72eca26d5c7
TIMOTHY EDWARD WILSON
TIMOTHY EDWARD
WILSON
Anagram-free Graph Colouring and Colour Schemes
Monash University
2019
Combinatorics
Anagrams
Colouring
Graph Theory
Combinatorics and Discrete Mathematics (excl. Physical Combinatorics)
2019-02-26 00:10:32
Thesis
https://bridges.monash.edu/articles/thesis/Anagram-free_Graph_Colouring_and_Colour_Schemes/7763543
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.