3 citations · 7 across the 10 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014★ 1 cited
Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
Qingqiong Cai, Xueliang Li, Di Wu
A path in an edge-colored graph is called a \emph{monochromatic path} if all the edges on the path are colored the same. An edge-coloring of is a \emph{monochromatic connection…
math.CO2014
Note on the upper bound of the rainbow index of a graph
Qingqiong Cai, Xueliang Li, Yan Zhao
A path in an edge-colored graph , where adjacent edges may be colored the same, is a rainbow path if every two edges of it receive distinct colors. The rainbow connection number…
math.CO2014★ 1 cited
The 3-rainbow index and connected dominating sets
Qingqiong Cai, Xueliang Li, Yan Zhao
A tree in an edge-colored graph is said to be rainbow if no two edges on the tree share the same color. An edge-coloring of is called 3-rainbow if for any three vertices in …