An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose ed... more An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this paper we prove several non-trivial upper bounds for rc(G), as
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose ed... more An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this paper we prove several non-trivial upper bounds for rc(G), as
Uploads
Papers by Arie Lev