A BRICS Mini-Course
May 17, 18, 29 and 31, 2001
Zsolt Tuza, email@example.com
Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, Hungary
The classical concept of graph colouring means a partition of the vertex set (or the edge set) into subsets consisting of mutually nonadjacent elements. Recent problems in computer science and operations research (e.g. frequency assignment, classroom scheduling, parallel matrix-factorization algorithms) have lead to various new applications and generalizations as well. In the lectures we present basic and advanced techniques, and mention many open problems.