Tight minimum colored degree condition for rainbow connectivity

Andrzej Czygrinow, Xiaofan Yuan

Let $G=(V,E)$ be a graph on $n$ vertices, and let $c:E\to P$, where $P$ is a set of colors. Let $\hat{I}{´}^c(G)={\min }_{v\in V}\{d^c(v)\}$ where $d^c(v)$ is the number of color…