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.
Library of Congress Subject Headings
Steiner systems; Map-coloring problem; Hypergraphs
Department, Program, or Center
Computer Science (GCCIS)
Schornstein, Nancy M., "Computing the chromatic number of t-(v,k,[lambda]) designs" (1989). Thesis. Rochester Institute of Technology. Accessed from
RIT – Main Campus