作者: Xueliang Li , Yuefang Sun
DOI:
关键词:
摘要: The concept of rainbow connection was introduced by Chartrand et al. in 2008. It is fairly interesting and recently quite a lot papers have been published about it. In this survey we attempt to bring together most the results that dealt with We begin an introduction, then try organize work into five categories, including (strong) number, $k$-connectivity, $k$-rainbow index, vertex-connection algorithms computational complexity. This also contains some conjectures, open problems or questions.