Some Remarks on Rainbow Connectivity
Combinatorics
2016-10-27 v2
Abstract
An edge (vertex) coloured graph is rainbow-connected if there is a rainbow path between any two vertices, i.e. a path all of whose edges (internal vertices) carry distinct colours. Rainbow edge (vertex) connectivity of a graph is the smallest number of colours needed for a rainbow edge (vertex) colouring of . In this paper we propose a very simple approach to studying rainbow connectivity in graphs. Using this idea, we give a unified proof of several known results, as well as some new ones.
Cite
@article{arxiv.1501.00821,
title = {Some Remarks on Rainbow Connectivity},
author = {Nina Kamčev and Michael Krivelevich and Benny Sudakov},
journal= {arXiv preprint arXiv:1501.00821},
year = {2016}
}