4 citations · 5 across the 2 of their papers we have counts for
3 papers
math.CO2017★ 1 cited
Anagram-free colourings of graph subdivisions
Tim E. Wilson, David R. Wood
An anagram is a word of the form where is a non-empty word and is a permutation of . A vertex colouring of a graph is anagram-free if no subpath of the graph is an…
math.CO2016★ 4 cited
Transversals in Latin arrays with many distinct symbols
Darcy Best, Kevin Hendrey, Ian M. Wanless +2
An array is row-Latin if no symbol is repeated within any row. An array is Latin if it and its transpose are both row-Latin. A transversal in an array is a selection of…
math.CO2016
Anagram-free Graph Colouring
Tim E. Wilson, David R. Wood
An anagram is a word of the form where is a non-empty word and is a permutation of . We study anagram-free graph colouring and give bounds on the chromatic number.…