Hardness results for total rainbow connection of graphs

Lily Chen, Bofeng Huo, Yingbin Ma. Hardness results for total rainbow connection of graphs. Discussiones Mathematicae Graph Theory, 36(2):355-362, 2016. [doi]

@article{ChenHM16,
  title = {Hardness results for total rainbow connection of graphs},
  author = {Lily Chen and Bofeng Huo and Yingbin Ma},
  year = {2016},
  doi = {10.7151/dmgt.1856},
  url = {http://dx.doi.org/10.7151/dmgt.1856},
  researchr = {https://researchr.org/publication/ChenHM16},
  cites = {0},
  citedby = {0},
  journal = {Discussiones Mathematicae Graph Theory},
  volume = {36},
  number = {2},
  pages = {355-362},
}