1. Ananth, P., Nasré, M.: New hardness results in rainbow connectivity (2011). arXiv:1104.2074 [cs.CC]
2. Andrews, E., Laforge, E., Lumduanhom, C., Zhang, P.: On proper-path colorings in graphs. J. Combin. Math. Combin. Comput. 97, 189–207 (2016)
3. Bondy, J.A., Murty, U.S.R.: Graph Therory, GTM 244. Springer, New York (2008)
4. Borozan, V., Fujita, S., Gerek, A., Magnant, C., Manoussakis, Y., Montero, L., Tuza, Z.: Proper connection of graphs. Discrete Math. 312(17), 2550–2560 (2012)
5. Cai, Q., Li, X., Song, J.: Solutions to conjectures on the $$(k,\ell )$$-rainbow index of complete graphs. Networks 62(3), 220–224 (2013)