BRICS · Contents · Programme

Graph Colourings

A BRICS Mini-Course
May 17, 18, 29 and 31, 2001

Lectures by
Zsolt Tuza,
Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, Hungary

Course Contents

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.


Thursday May 17, 2001, 14:15-16:00 in Auditorium D4

Friday May 18, 2001, 12:15-14:00 in Colloquium B3

Tuesday May 29, 2001, 12:15-14:00 in Auditorium D4

Thursday May 31, 2001, 12:15-14:00 in Auditorium D4