Solution to a conjecture on the proper connection number of graphs

Fei Huang, Xueliang Li, Zhongmei Qin +1

A path in an edge-colored graph is called a proper path if no two adjacent edges of the path receive the same color. For a connected graph $G$, the proper connection number $pc(G)$…