Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Rainbow connection number of graphs
Speaker:Sunil Chandran
coming from:Max-Planck-Institut für Informatik - D1
Speakers Bio:Professor at the Indian Institute of Science, Bangalore, India.
Event Type:AG1 Advanced Mini-Course
Visibility:D1, D2, D3, D4, D5, RG1, SWS, MMCI
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Tuesday, 6 October 2015
Duration:30 Minutes
Building:E1 4
Raibow coloring of a graph is an edge coloring with the property that

between any pair of vertices there is a rainbow path: i.e. a path where the colors on the edges of this path are all distinct. The minimum number of colors required to rainbow-color a graph is the rainbow connection number of the graph. I will describe some of our interesting results on this topic. I will also explain some interesting algorithmic questions regarding rainbow coloring.

Name(s):Sunil Chandran
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):
  • Arjit Ghosh, 09/08/2015 05:19 PM
  • Arjit Ghosh, 09/08/2015 05:15 PM -- Created document.