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:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf696cc4568
DTSTART;TZID=America/Toronto:20180706T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180706T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-chinh-t-hoang
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 55
 01 Waterloo ON N2L 3G1 Canada
SUMMARY:Tutte Colloquium - Chinh T. Hoang
CLASS:PUBLIC
DESCRIPTION:TITLE: The coloring problem for restricted graph classes\n\nSp
 eaker:\n Chinh T. Hoang\n\nAffiliation:\n Wilfred Laurier University\n\nRo
 om:\n MC 5501\n\nABSTRACT:\n\nLet L be a set of graphs. Free(L) is the set
  of graphs that do not\ncontain any graph in L as an induced subgraph.
DTSTAMP:20260403T071700Z
END:VEVENT
END:VCALENDAR