6 citations · 10 across the 7 of their papers we have counts for
7 papers
Rainbow connection number and independence number of a graph
Jiuying Dong, Xueliang Li
Let be an edge-colored connected graph. A path of is called rainbow if its every edge is colored by a distinct color. is called rainbow connected if there exists a rain…
Note on rainbow connection number of dense graphs
Jiuying Dong, Xueliang Li
An edge-colored graph is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph ,…
On a question on graphs with rainbow connection number 2
Jiuying Dong, Xueliang Li
For a connected graph , the \emph{rainbow connection number } of a graph was introduced by Chartrand et al. In "Chakraborty et al., Hardness and algorithms for rainbo…
Sharp upper bound for the rainbow connection number of a graph with diameter 2
Jiuying Dong, Xueliang Li
Let be a connected graph. The \emph{rainbow connection number } of a graph was recently introduced by Chartrand et al. Li et al. proved that for every bridgeless gra…
Rainbow connection number, bridges and radius
Jiuying Dong, Xueliang Li
Let be a connected graph. The notion \emph{the rainbow connection number } of a graph was introduced recently by Chartrand et al. Basavaraju et al. showed that for e…
Two rainbow connection numbers and the parameter
Jiuying Dong, Xueliang Li
The rainbow connection number and the rainbow vertex-connection number of a graph were introduced by Chartrand et al. and Krivelevich and Yuster, respectively.…