MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Rainbow connection number of graphs

Sunil Chandran
Max-Planck-Institut für Informatik - D1
AG1 Advanced Mini-Course

Professor at the Indian Institute of Science, Bangalore, India.
AG 1, AG 2, AG 3, AG 4, AG 5, RG1, SWS, MMCI  
AG Audience
English

Date, Time and Location

Tuesday, 6 October 2015
13:00
30 Minutes
E1 4
024
Saarbrücken

Abstract

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.

Contact

Sunil Chandran
--email hidden
passcode not visible
logged in users only

Arjit Ghosh, 09/08/2015 17:19
Arjit Ghosh, 09/08/2015 17:15 -- Created document.