1. Andrews, E., Laforge, E., Lumduanhom, C., Zhang, P.: On proper-path colorings in graphs. J. Combin. Math. Combin. Comput. 97, 189–207 (2016)
2. Borozan, V., Fujita, S., Gerek, A., Magnant, C., Manoussakis, Y., Montero, L., Tuza, Z.S.: Proper connection of graphs. Discrete Math. 312, 2550–2560 (2012)
3. Chang, H., Huang, Z., Li, X., Mao, Y., Zhao, H.: Nordhaus-Gaddum-type theorem for conflict-free connection number of graphs, arXiv:1705.08316v1[math.CO]
4. Chang, H., Doan, T.D., Huang, Z., Jendrol’, S., Li, X., Schiermeyer, I.: Graphs with conflict-free connection number two. Graphs Combin. 34, 1553–1563 (2018)
5. Chartrand, G., Johns, G.L., McKeon, K.A., Zhang, P.: Rainbow connection in graphs. Math Bohemica 133(1), 85–98 (2008)