1 paper
Igor Araujo, Kareem Benaissa, Richard Bi +3
A path in an edge-colored graph is said to be rainbow if no color repeats on it. An edge-colored graph is said to be rainbow k-connected if every pair of vertices is connected by…