Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles

Qiaojun Shu, Guohui Lin, Eiji Miyano

An acyclic edge coloring of a graph $G$ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic edge coloring conjecture by Fiam{č}ik (1978) and Alon, S…