Rainbow Connections of Graphs: A Survey

The concept of rainbow connection was introduced by Chartrand et al. [ 14 ] in 2008. It is interesting and recently quite a lot papers have been published about it. In this survey we attempt to bring together most of the results and papers that dealt with it. We begin with an introduction, and then...

Full description

Saved in:
Bibliographic Details
Published in:Graphs and combinatorics Vol. 29; no. 1; pp. 1 - 38
Main Authors: Li, Xueliang, Shi, Yongtang, Sun, Yuefang
Format: Journal Article
Language:English
Published: Japan Springer Japan 01.01.2013
Springer Nature B.V
Subjects:
Algorithms
Categories
Combinatorial analysis
Combinatorics
Complexity
Computation
Computational mathematics
Engineering Design
Graph algorithms
Graph theory
Graphs
Joints
Mathematics
Mathematics and Statistics
Rainbows
Survey
68Q25
(Strong) rainbow connection number
05D40
05C40
Rainbow path
Algorithm
Computational complexity
Rainbow vertex-connection number
connectivity
Rainbow
68R10
rainbow index
05C35
05C15
ISSN:0911-0119, 1435-5914
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The concept of rainbow connection was introduced by Chartrand et al. [ 14 ] in 2008. It is interesting and recently quite a lot papers have been published about it. In this survey we attempt to bring together most of the results and papers that dealt with it. We begin with an introduction, and then try to organize the work into five categories, including (strong) rainbow connection number, rainbow k -connectivity, k -rainbow index, rainbow vertex-connection number, algorithms and computational complexity. This survey also contains some conjectures, open problems and questions.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0911-0119
1435-5914
DOI:10.1007/s00373-012-1243-2