1. Bollobás, B.: On graphs with at most three independent paths connecting any two vertices. Studia Sci. Math. Hungar., 1, 137–140 (1966)
2. Bondy, J. A., Murty, U. S. R.: Graph Theory, GTM 224, Springer, 2008
3. Chartrand, G., Johns, G. L., McKeon, K. A., et al.: Rainbow connection in graphs. Math. Bohem., 133, 85–98 (2008)
4. Chartrand, G., Devereaux, S., Haynes, T. W., et al.: Rainbow disconnection in graphs. Discuss. Math. Graph Theory, 38, 1007–1021 (2018)
5. Krivelevich, M., Yuster, R.: The rainbow connection of a graph is (at most) reciprocal to its minimum degree. J. Graph Theory, 63, 185–191 (2010)