6 citations · 6 across the 1 of their papers we have counts for
1 paper
Jing He, Hongyu Liang
A path in an edge-colored graph is called a \emph{rainbow path} if all edges on it have pairwise distinct colors. For k≥1, the \emph{rainbow-k-connectivity} of a graph G,…