Decomposing edge-colored graphs under color degree constraints

Ruonan Li, Shinya Fujita, Guanghui Wang

For an edge-colored graph $G$, the minimum color degree of $G$ means the minimum number of colors on edges which are adjacent to each vertex of $G$. We prove that if $G$ is an edge…