9 citations · 15 across the 3 of their papers we have counts for
3 papers
math.CO2013★ 5 cited
The 3-rainbow index of graph operations
Tingting Liu, Yumei Hu
A tree , in an edge-colored graph , is called {\em a rainbow tree} if no two edges of are assigned the same color. A {\em -rainbow coloring}of is an edge coloring…
math.CO2013★ 9 cited
Some upper bounds for 3-rainbow index of graphs
Tingting Liu, Yumei Hu
A tree , in an edge-colored graph , is called {\em a rainbow tree} if no two edges of are assigned the same color. A {\em -rainbow coloring}of is an edge coloring…
math.CO2013★ 1 cited
A note on the 3-rainbow index of
Tingting Liu, Yumei Hu
A tree , in an edge-colored graph , is called {\em a rainbow tree} if no two edges of are assigned the same color. For a vertex subset , a tree that connects $…