Rainbow subgraphs in edge-colored planar and outerplanar graphs

Abstract

Let G be a class of graphs. The strong rainbow number of the graph H in G is the minimum number of colors k such that every graph G ∈ G admits an edge coloring with at most k colors in which all copies of H are rainbow (i