BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv5.3.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://aarms.math.ca
X-WR-CALDESC:Events for
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20201021T153000
DTEND;TZID=UTC:20201021T163000
DTSTAMP:20230606T064155
CREATED:20201006T115021Z
LAST-MODIFIED:20201006T115021Z
UID:5508-1603294200-1603297800@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Dr. Ben Cameron (University of Guelph)
DESCRIPTION:Title: Families of graphs containing only finitely many vertex-critical graphs. \nIn this talk\, motivated by algorithmic aspects of graph colouring\, we will consider the problem of classifying vertex-critical graphs in families of graphs. We will complete a dichotomy theorem for the number of k-vertex-critical H-free graphs when H is a graph of order four. Our results also reduce the remaining open problem for graphs of all orders to two families of graphs. Toward implementing the corresponding graph colouring algorithms\, we then improve upon previous research to show tight upper bounds on the order and independence number of k-vertex-critical graphs in another family of graphs\, allowing for exhaustive generation of these graphs for k at most 7 . Joint work with Chính Hoàng and Joe Sawada
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-dr-ben-cameron-university-of-guelph/
LOCATION:Zoom seminar
CATEGORIES:Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason%20Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
END:VCALENDAR