Conflict-free chromatic index of bipartite graphs

An edge coloring of a graph $G$ is called conflict-free if, for every edge, its closed neighborhood contains a color that appears exactly once. The least number of colors required for such a coloring is the conflict-free chromatic index of $G$, denoted by $\chi'_{CF}(G)$. Kamyczura, Meszka, and Przyby{\l}o conjectured that $\chi'_{CF}(G)\le 3$ for any bipartite graph $G$ without isolated vertices. In this paper, we confirm this conjecture.