BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1748
DTSTAMP:20260805T113820Z
SUMMARY:Conflict-free coloring of graphs
DESCRIPTION:Speaker: Bhyravarapu Sriram (IIT Guwahati)\n\nAbstract: \n A c
 onflict-free coloring of a graph G is a vertex coloring in which every v
 ertex has a color that appears exactly once in its neighborhood. The minim
 um number of colors required is called the conflict-free chromatic number 
 of G. In this talk\, we first show that every planar graph admits a confl
 ict-free coloring using at most five colors. We then present a polynomial-
 time algorithm for biconvex graphs\, a subclass of bipartite graphs\, base
 d on a multichain ordering\, a structural technique that may also prove us
 eful in designing algorithms for other graph problems. \n \nBio: I am an
  Assistant Professor in the Department of Computer Science and Engineering
  at IIT Guwahati. Before joining IIT Guwahati\, I spent three years as a p
 ostdoctoral researcher at the Institute of Mathematical Sciences (IMSc)\, 
 Chennai. I received my PhD from IIT Hyderabad in 2016. \n
URL:https://www.tcs.tifr.res.in/web/events/1748
DTSTART;TZID=Asia/Kolkata:20260811T160000
DTEND;TZID=Asia/Kolkata:20260811T170000
LOCATION:via Zoom in A201
END:VEVENT
END:VCALENDAR