2013/10/09 by Tingting Liu, Liu, Tingting, Yumei Hu +1
Computer Science · Mathematics · #05C05 #05C15 #05C57 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #math.CO #msc:05C05 #msc:05C15 #msc:05C57
paper · pdf · doi:10.48550/arxiv.1310.2353
6 pages 4 figures
arxiv created 2013/10/09 · openalex publication_date 2013/10/09 · arxiv updated 2013/10/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A tree T, in an edge-colored graph G, is called \em a rainbow tree if no two edges of T are assigned the same color. For a vertex subset S∈ V(G), a tree that connects S in G is called an S-tree. A \em k-rainbow coloring of G is an edge coloring of G having the property that for every set S of k vertices of G, there exists a rainbow S-tree T in G. The minimum number of colors needed in a k-rainbow coloring of G is the \em k-rainbow index of G, denoted by rxk(G). In this paper, we obtain the exact values of rx3(K2,t) for any t≥ 1.