1 paper
Josep DÃaz, Ãznur YaÅar Diner, Maria Serna +1
An edge-colored multigraph G is rainbow connected if every pair of vertices is joined by at least one rainbow path, i.e., a path where no two edges are of the same color. In the…