Rich-neighbor 5-edge-colorings of subcubic graphs whose 3-vertices induce a matching

Jiangxu Kong, Zhuming Lin, Yan Wang

Let $\phi$ be a proper edge-coloring of a graph $G$. An edge is called rich if all edges adjacent to it receive pairwise distinct colors. The coloring $\phi$ is a rich-neighbor edge-colo…