A technique for colouring a graph applicable to large scale timetabling problems

Abstract

The connection is explained between scheduling problems and colouring the vertices of a graph such that no two adjacent vertices are the same colour, and the minimum number of colours are used. A method of colouring a graph suitable for large scale timetabling problems is described.