Wenjing Li, Xueliang Li, Di Wu. Hardness result for the total rainbow k-connection of graphs. Applied Mathematics and Computation, 305:27-31, 2017. [doi]
@article{LiLW17-0,
title = {Hardness result for the total rainbow k-connection of graphs},
author = {Wenjing Li and Xueliang Li and Di Wu},
year = {2017},
doi = {10.1016/j.amc.2017.01.068},
url = {http://dx.doi.org/10.1016/j.amc.2017.01.068},
researchr = {https://researchr.org/publication/LiLW17-0},
cites = {0},
citedby = {0},
journal = {Applied Mathematics and Computation},
volume = {305},
pages = {27-31},
}