Cyclic colorings of plane graphs with independent faces

Let GG be a plane graph with maximum face size Δ∗Δ∗. If all faces of GG with size four or more are vertex disjoint, then GG has a cyclic coloring with Δ∗+1Δ∗+1 colors, i.e., a coloring such that all vertices incident with the same face receive distinct colors.