Now we recolor the edges incident with big faces with r colors (these r colors
are different than the previous k ones) in such a way that face-adjacent edges
receive different colors. Every small face of G is adjacent to at most one big face,
otherwise G contains two big faces which influence each other. Consequently,
we recolor at most one edge on every small face of G. In this way we obtain a
facial r-acyclic edge-coloring of G which uses at most r + k colors.
ones