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

作者：David Carrico Wood · 发表于：The Computer Journal · 年份：1969 · DOI：10.1093/comjnl/12.4.317 · 被引用次数：93 · 研究领域：Scheduling and Timetabling Solutions、Scheduling and Optimization Algorithms

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.