Shasha Li, Xueliang Li, Yongtang Shi. Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs. Applied Mathematics and Computation, 258:155-161, 2015. [doi]
@article{LiLS15,
title = {Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs},
author = {Shasha Li and Xueliang Li and Yongtang Shi},
year = {2015},
doi = {10.1016/j.amc.2015.02.015},
url = {http://dx.doi.org/10.1016/j.amc.2015.02.015},
researchr = {https://researchr.org/publication/LiLS15},
cites = {0},
citedby = {0},
journal = {Applied Mathematics and Computation},
volume = {258},
pages = {155-161},
}