Degree sum conditions for graphs to have proper connection number 2

Hong Chang, Zhong Huang, Xueliang Li

A path $P$ in an edge-colored graph $G$ is a \emph{proper path} if no two adjacent edges of $P$ are colored with the same color. The graph $G$ is \emph{proper connected} if, betwee…