Article

# Rainbow Connections of Graphs: A Survey

(Impact Factor: 0.33). 01/2013; 29(1):1--38. DOI: 10.1007/s00373-012-1243-2
Source: arXiv

ABSTRACT 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 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 or questions.

5 Followers
·
161 Views
• Source
• Source
##### Article: Proper Connection Numbers of Complementary Graphs
[Hide abstract]
ABSTRACT: A path $P$ in an edge-colored graph $G$ is called a proper path if no two adjacent edges of $P$ are colored the same, and $G$ is proper connected if every two vertices of $G$ are connected by a proper path in $G$. The proper connection number of a connected graph $G$, denoted by $pc(G)$, is the minimum number of colors that are needed to make $G$ proper connected. In this paper, we investigate the proper connection number of the complement of graph $G$ according to some constraints of $G$ itself. Also, we characterize the graphs on $n$ vertices that have proper connection number $n-2$. Using this result, we give a Nordhaus-Gaddum-type theorem for the proper connection number. We prove that if $G$ and $\overline{G}$ are both connected, then $4\le pc(G)+pc(\overline{G})\le n$, and the only graph attaining the upper bound is the tree with maximum degree $\Delta=n-2$.
• Source
##### Article: Rainbow connection in some digraphs
[Hide abstract]
ABSTRACT: An edge-coloured graph $G$ is {\it rainbow connected} if any two vertices are connected by a path whose edges have distinct colours. This concept was introduced by Chartrand et al. in \cite{ch01}, and it was extended to oriented graphs by Dorbec et al. in \cite{DI}. In this paper we present some results regarding this extention, mostly for the case of circulant digraphs.