1. Chakraborty S, Fischer E, Matsliah A, Yuster R (2009) Hardness and algorithms for rainbow connection. J Comb Optim 21(3):330–347
2. Ananth P, Nasre M, Sarpatwar KK (2011) Rainbow connectivity: hardness and tractability. In: IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), pp 241–251
3. Le VB, Tuza Z (2009) Finding optimal rainbow connection is hard, Technical Report CS-03-09, Universitat Rostock
4. Li X, Liu S (2011) Rainbow vertex-connection number of 2-connected graphs. arxiv:1110.5770v1
5. Hariram kumar CS, Parvathi N (2017) Rainbow vertex coloring for shadow, square and splitting graph of bi-star graph. International Journal of Pure and Applied Mathematics 113:244–252