# Search results for: Xueliang Li

Bulletin of the Malaysian Mathematical Sciences Society > 2015 > 38 > 3 > 1235-1241

Applied Mathematics and Computation > 2014 > 242 > Complete > 277-280

Graphs and Combinatorics > 2013 > 29 > 5 > 1471-1475

*G*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

*G*, denoted by

*rc*(

*G*), is the smallest number of colors that are needed in order to make

*G*rainbow connected. In this paper, we proved that

*rc*(

*G*) ≤ 3(

*n*+ 1)/5 for all 3-connected graphs.