17 citations · 50 across the 13 of their papers we have counts for
1 paper · 2 filters
Eduard Eiben, Robert Ganian, Juho Lauri
An edge-colored graph G is said to be rainbow connected if between each pair of vertices there exists a path which uses each color at most once. The rainbow connection number, de…