BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6aa692e09b770
DTSTART;TZID=America/Toronto:20260914T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260914T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/acyclic-list
 -colouring-locally-planar-graphs-0
SUMMARY:Acyclic List Colouring Locally Planar Graphs
CLASS:PUBLIC
DESCRIPTION:ACYCLIC LIST COLOURING LOCALLY PLANAR GRAPHS\n\nMassimo Vicenzo
  | University of Waterloo\n\nABSTRACT: A (vertex) colouring of graph is ac
 yclic if it contains no\nbicoloured cycle. In 1979\, Borodin proved that p
 lanar graphs are\nacyclically 5-colourable. In 2010\, Kawarabayashi and Mo
 har proved that\nlocally planar graphs are acyclically 7-colourable. In 20
 02\, Borodin\,\nFon-Der-Flaass\, Kostochka\, Raspaud\, and Sopena proved t
 hat planar\ngraphs are acyclically 7-list-colourable. In this talk we disc
 uss our\nresult that locally planar graphs are acyclically\n9-list-coloura
 ble—no bound for acyclic list colouring locally planar\ngraphs for any f
 ixed number of colours was previously known.\n\nThis is joint work with Lu
 ke Postle and Evelyne Smith-Roberge. 
DTSTAMP:20260913T121112Z
END:VEVENT
END:VCALENDAR