4 citations · 15 across the 9 of their papers we have counts for
1 paper · 1 filter
Prabhanjan Ananth, Meghana Nasre, Kanthi K Sarpatwar
A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists…