Sujuan Liu

activity

20102012

most citedRainbow connection of graphs with diameter 2

7 citations · 12 across the 6 of their papers we have counts for

collaborators

Showing 2012Show all

2 papers · 1 filter

math.CO2012

Rainbow connection number and the number of blocks

Xueliang Li, Sujuan Liu

An edge-colored graph $G$ is rainbow connected if every pair of vertices of $G$ are connected by a path whose edges have distinct colors. The rainbow connection number $r c (G)$ of $…

math.CO2012★ 2 cited

A sharp upper bound for the rainbow 2-connection number of 2-connected graphs

Xueliang Li, Sujuan Liu

A path in an edge-colored graph is called {\em rainbow} if no two edges of it are colored the same. For an $ℓ$ -connected graph $G$ and an integer $k$ with $1 \leq k \leq ℓ$ , th…