# Search results for: Xueliang Li

Discussiones Mathematicae Graph Theory > 2017 > 37 > 1 > 141-154

Discrete Applied Mathematics > 2016 > 209 > C > 68-74

Graphs and Combinatorics > 2013 > 29 > 1 > 1-38

*k*...

Discrete Mathematics > 2012 > 312 > 8 > 1453-1457

Graphs and Combinatorics > 2012 > 28 > 2 > 251-263

*G*, where adjacent edges may be colored the same, is called a rainbow path if no two edges of it are colored the same. A nontrivial connected graph

*G*is rainbow connected if for any two vertices of

*G*there is a rainbow path connecting them. The rainbow connection number of

*G*, denoted

*rc*(

*G*), is defined as the smallest number of colors such that

*G*is rainbow connected...

Computers and Mathematics with Applications > 2011 > 62 > 11 > 4082-4088