17 citations · 50 across the 13 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DM2014★ 4 cited
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs
Melissa Keranen, Juho Lauri
A path in an edge-colored graph is rainbow if no two edges of it are colored the same. The graph is rainbow-connected if there is a rainbow path between every pair of verti…
cs.CC2014★ 17 cited
Further Hardness Results on Rainbow and Strong Rainbow Connectivity
Juho Lauri
A path in an edge-colored graph is \textit{rainbow} if no two edges of it are colored the same. The graph is said to be \textit{rainbow connected} if there is a rainbow path betwee…