Conflict-free chromatic index of trees

Shanshan Guo, Ethan Y. H. Li, Luyi Li +1

A graph $G$ is conflict-free $k$-edge-colorable if there exists an assignment of $k$ colors to $E(G)$ such that for every edge $e\in E(G)$, there is a color that is assigned to exa…