Computing the chromatic number of t-(v,k,[lambda]) designs

Abstract

Colouring t-designs has previously been shown to be an NP-complete problem; heuristics and a practical algorithm for this problem were developed for this thesis; the algorithm was then employed to find the chromatic numbers of the sixteen non- isomorphic 2-(25, 4, 1) designs and the four cyclic 2-(19, 3, 1) designs. This thesis additionally examines the existing literature on colouring and finding chromatic numbers of t-designs