Abstract
An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. This concept was introduced by Chartrand et al. (Math Bohemica 133(1):85–98, 2008), and it was extended to oriented graphs by Dorbec et al. (Discrete Appl Math 179(31):69–78, 2014). In this paper we present some results regarding this extension, mostly for the case of circulant digraphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bang-Jensen, J., Gutin, G.: Digraphs. Springer, New York (2009)
Chakraborty, S., Fischer, E., Matsliah, A., Yuster, R.: Hardness and algorithms for rainbow connection. J. Combin. Optim. 21(3), 330–347 (2011)
Chartrand, G., Johns, G.L., McKeon, K.A., Zhang, P.: Rainbow connection in graphs. Math. Bohemica 133(1), 85–98 (2008)
Chartrand, G., Johns, G.L., McKeon, K.A., Zhang, P.: The rainbow connectivity of a graph. Networks 54, 75–81 (2009)
Dorbec, P., Schiermeyer, I., Sidorowicz, E., Sopena, E.: Rainbow connection in oriented graphs. Discrete Appl. Math. 179(31), 69–78 (2014)
Schiermeyer, I.: Bounds for the rainbow connection number of graphs. Discuss. Math. Graph Theory 30, 387–395 (2011)
Schiermeyer, I.: Rainbow connection and minimum degree. Discrete Appl. Math. 161(12), 387–395 (2013)
Kemnitz, A., Schiermeyer, I.: Graphs with rainbow connection number two. Discuss Math. Graph Theory 63, 185–191 (2010)
Krivelevich, M., Yuster, R.: The rainbow connection of a graph is (at most) reciprocal to its minimum degree. J. Graph Theory 63, 185–191 (2009)
Li, X., Liu, M., Schiermeyer, I.: Rainbow connection number of dense graphs. Discuss. Math. Graph Theory 33(3), 603–611 (2013)
Li, X., Liu, S.: A sharp upper bound for the rainbow 2-connection number of a 2-connected graph. Discrete Math. 313(6), 755–759 (2013)
Li, X., Shi, Y.: Rainbow connection in 3-connected graphs. Graphs Combin. 29(5), 1471–1475 (2013)
Li, X., Sun, Y.: Rainbow connections of graphs—a survey. Graphs Combin. 29(1), 1–38 (2013)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research partially supported by PAPIIT-México Project IN101912 and PAPIIT-México Project IN104915.
Rights and permissions
About this article
Cite this article
Alva-Samos, J., Montellano-Ballesteros, J.J. Rainbow Connection in Some Digraphs. Graphs and Combinatorics 32, 2199–2209 (2016). https://doi.org/10.1007/s00373-016-1723-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-016-1723-x