A tree in an edge-colored connected graph G is called a rainbow tree if no two edges of it are assigned the same color. For a vertex subset $$S\subseteq V(G)$$ S ⊆ V ( G ) , a tree is called an S-tree if it connects S in G. A 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 in G. The minimum number...
Financed by the National Centre for Research and Development under grant No. SP/I/1/77065/10 by the strategic scientific research and experimental development program:
SYNAT - “Interdisciplinary System for Interactive Scientific and Scientific-Technical Information”.