Seminar series
Date
Tue, 07 May 2019
Time
14:30 -
15:30
Location
L6
Speaker
Marthe Bonamy
Further Information
In this talk, we will discuss various results around Brooks' theorem: a graph has chromatic number at most its maximum degree, unless it is a clique or an odd cycle. We will consider stronger variants and local versions, as well as the structure of the solution space of all corresponding colorings.