Proper edge colorings of planar graphs with rainbow $C_4$-s

András Gyárfás, Ryan R. Martin, Miklós Ruszinkó +1

We call a proper edge coloring of a graph $G$ a B-coloring if every 4-cycle of $G$ is colored with four different colors. Let $q_B(G)$ denote the smallest number of colors needed f…