BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20260303T163000
DTEND;TZID=Asia/Seoul:20260303T173000
DTSTAMP:20260415T134254
CREATED:20250911T064608Z
LAST-MODIFIED:20260219T013227Z
UID:11576-1772555400-1772559000@dimag.ibs.re.kr
SUMMARY:Chính T. Hoàng\, Problems on graph coloring
DESCRIPTION:A k-coloring of a graph is an assignment of k colors to its vertices such that no two adjacent adjacent vertices receive the same color. The Coloring Problem is the problem of determining the smallest k such that the graph admits a k-coloring. Given a set L of graphs\, a graph G is L-free if G does not contain any graph in L as an induced subgraph. The complexity of the Coloring Problem for L-free graphs is known (NP-complete or polynomial-time solvable) whenever L contains a single graph. There has been keen interest in coloring graphs whose forbidden list L contains basic graphs such as induced paths\, induced cycles and their complements. In this talk\, I will provide a survey of recent progress on this topic.
URL:https://dimag.ibs.re.kr/event/2026-03-03/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR