Degree sum conditions for a graph to have bounded conflict-free connection number

Dinh Hanh Dang, Trung Duy Doan, Pham Hoang Ha +1

A path in an edge-coloured graph is called \emph{conflict-free} if a colour is exclusively applied to one of its edges. A graph $G$ is considered \emph{conflict-free connected} if…