The rainbow connection of a graph is (at most) reciprocal to its minimum degree

Michael Krivelevich, Raphael Yuster. The rainbow connection of a graph is (at most) reciprocal to its minimum degree. Journal of Graph Theory, 63(3):185-191, 2010. [doi]

@article{KrivelevichY10,
  title = {The rainbow connection of a graph is (at most) reciprocal to its minimum degree},
  author = {Michael Krivelevich and Raphael Yuster},
  year = {2010},
  doi = {10.1002/jgt.20418},
  url = {http://dx.doi.org/10.1002/jgt.20418},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/KrivelevichY10},
  cites = {0},
  citedby = {0},
  journal = {Journal of Graph Theory},
  volume = {63},
  number = {3},
  pages = {185-191},
}