Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs

Melissa Keranen, Juho Lauri

A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of verti…