1. Ananth, P., Nasre, M., Sarpatwar, K.K.: Rainbow connectivity: hardness and tractability. In: Proceedings of the 31st FSTTCS, pp. 241–251 (2011)
2. Andrews, E., Lumduanhom, C., Laforge, E., Zhang, P.: On proper-path colorings in graphs. J. Comb. Math. Comb. Comput. 97, 189–207 (2016)
3. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308–340 (1991)
4. Barrett, C., et al.: Predecessor existence problems for finite discrete dynamical systems. Theoret. Comput. Sci. 386(1–2), 3–37 (2007)
5. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, 1st edn. Macmillan Press, New York (1976)