An updated survey on rainbow connections of graphs - a dynamic survey

Authors

Xueliang Li, Nankai University, ChinaFollow
Yuefang Sun, Shaoxing University, ChinaFollow

Publication Date

2017

Revision Date

2017

Abstract

The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and Zhang in 2008. Nowadays it has become a new and active subject in graph theory. There is a book on this topic by Li and Sun in 2012, and a survey paper by Li, Shi and Sun in 2013. More and more researchers are working in this field, and many new papers have been published in journals. In this survey we attempt to bring together most of the new results and papers that deal with this topic. We begin with an introduction, and then try to organize the work into the following categories, rainbow connection coloring of edge-version, rainbow connection coloring of vertex-version, rainbow $k$-connectivity, rainbow index, rainbow connection coloring of total-version, rainbow connection on digraphs, rainbow connection on hypergraphs. This survey also contains some conjectures, open problems and questions for further study.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.

Recommended Citation

Li, Xueliang and Sun, Yuefang (2017) "An updated survey on rainbow connections of graphs - a dynamic survey," Theory and Applications of Graphs: Vol. 0: Iss. 1, Article 3.
DOI: 10.20429/tag.2017.000103
Available at: https://digitalcommons.georgiasouthern.edu/tag/vol0/iss1/3