Finite families of forbidden subgraphs for rainbow connection in graphs

A connected edge-colored graph GG is rainbow-connected if any two distinct vertices of GG are connected by a path whose edges have pairwise distinct colors; the rainbow connection number rc(G) of GG is the minimum number of colors such that GG is rainbow-connected. We consider families FF of connected graphs for which there is a constant kFkF such that, for every connected FF-free graph GG, rc(G)≤diam(G)+kF, where diam(G) is the diameter of GG. In the paper, we finalize our previous considerations and give a complete answer for any finite family FF.