Add to ORKGThe rainbow connection number of a graph G is the least number of colours in a (not necessarily proper) edge-colouring of G such that every two vertices are joined by a path which contains no colour twice. Improving a result of Caro et al., we prove that the rainbow connection number of every 2-connected graph with n vertices is at most dn/2e. The bound is optimal.
The minimum number of colors required to color the edges of a graph so that any two distinct vertice...
A path in an edge-colored graph is rainbow if no two edges of it are colored the same, and the graph...
In a properly vertex-colored graph G, a path P is a rainbow path if no two vertices of P have the sa...
An edge-coloured graph G is rainbow-connected if any two vertices are connected by a path whose edge...
An edge-coloured graph G is rainbow-connected if any two vertices are connected by a path whose edge...
A path in an edge-coloured graph is called a rainbow path if its edges receive pairwise distinct col...
An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edge...
An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edge...
A path in an edge-colored (respectively vertex-colored) graph G is rainbow (respectively vertex-rain...
An edge-coloured connected graph G = (V,E) is called rainbow-connected if each pair of distinct vert...
AbstractA path in an edge-colored graph G, where adjacent edges may have the same color, is a rainbo...
AbstractAn edge colored graph G = (V(G), E(G)) is said rainbow connected, if any two vertices are co...
AbstractLet G be a nontrivial connected graph. For k∈N, we define a coloring c:E(G)→{1,2,…,k} of the...
Rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to ...
Rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to ...
The minimum number of colors required to color the edges of a graph so that any two distinct vertice...
A path in an edge-colored graph is rainbow if no two edges of it are colored the same, and the graph...
In a properly vertex-colored graph G, a path P is a rainbow path if no two vertices of P have the sa...
An edge-coloured graph G is rainbow-connected if any two vertices are connected by a path whose edge...
An edge-coloured graph G is rainbow-connected if any two vertices are connected by a path whose edge...
A path in an edge-coloured graph is called a rainbow path if its edges receive pairwise distinct col...
An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edge...
An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edge...
A path in an edge-colored (respectively vertex-colored) graph G is rainbow (respectively vertex-rain...
An edge-coloured connected graph G = (V,E) is called rainbow-connected if each pair of distinct vert...
AbstractA path in an edge-colored graph G, where adjacent edges may have the same color, is a rainbo...
AbstractAn edge colored graph G = (V(G), E(G)) is said rainbow connected, if any two vertices are co...
AbstractLet G be a nontrivial connected graph. For k∈N, we define a coloring c:E(G)→{1,2,…,k} of the...
Rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to ...
Rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to ...
The minimum number of colors required to color the edges of a graph so that any two distinct vertice...
A path in an edge-colored graph is rainbow if no two edges of it are colored the same, and the graph...
In a properly vertex-colored graph G, a path P is a rainbow path if no two vertices of P have the sa...