All graphs considered in this paper are simple, finite and undirected. Let G be a nontrivial connected graph with an edge coloring c : E(G) → {1, 2, · · · , k}, k ∈ N, where adjacent edges may be colored the same. A path in G is called a rainbow path if no two edges of it are colored the same
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 connected graph G = (V,E) is called rainbow-connected if each pair of distinct vert...
An edge-coloured graph G is rainbow-connected if any two vertices are connected by a path whose edge...
Let G be a nontrivial connected graph on which is dened a color-ing c : E(G) ! f1; 2; ; kg; k 2 N...
summary:Let $G$ be a nontrivial connected graph on which is defined a coloring $c\: E(G) \rightarrow...
AbstractLet G be a nontrivial connected graph. For k∈N, we define a coloring c:E(G)→{1,2,…,k} of the...
A path in an edge-colored (respectively vertex-colored) graph G is rainbow (respectively vertex-rain...
AbstractLet G = (V(G), E(G)) be a simple, finite, and connected graph. Let k be a positive integer. ...
A path in an edge-coloured graph is called a rainbow path if its edges receive pairwise distinct col...
AbstractA path in an edge-colored graph G, where adjacent edges may have the same color, is a rainbo...
The rainbow connection number of a graph G is the least number of colours in a (not necessarily prop...
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...
AbstractLet G = (V(G), E(G)) be a nontrivial, finite, and connected graph. Define a k-coloring c : E...
The minimum number of colors required to color the edges of a graph so that any two distinct vertice...
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 connected graph G = (V,E) is called rainbow-connected if each pair of distinct vert...
An edge-coloured graph G is rainbow-connected if any two vertices are connected by a path whose edge...
Let G be a nontrivial connected graph on which is dened a color-ing c : E(G) ! f1; 2; ; kg; k 2 N...
summary:Let $G$ be a nontrivial connected graph on which is defined a coloring $c\: E(G) \rightarrow...
AbstractLet G be a nontrivial connected graph. For k∈N, we define a coloring c:E(G)→{1,2,…,k} of the...
A path in an edge-colored (respectively vertex-colored) graph G is rainbow (respectively vertex-rain...
AbstractLet G = (V(G), E(G)) be a simple, finite, and connected graph. Let k be a positive integer. ...
A path in an edge-coloured graph is called a rainbow path if its edges receive pairwise distinct col...
AbstractA path in an edge-colored graph G, where adjacent edges may have the same color, is a rainbo...
The rainbow connection number of a graph G is the least number of colours in a (not necessarily prop...
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...
AbstractLet G = (V(G), E(G)) be a nontrivial, finite, and connected graph. Define a k-coloring c : E...
The minimum number of colors required to color the edges of a graph so that any two distinct vertice...
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 connected graph G = (V,E) is called rainbow-connected if each pair of distinct vert...
An edge-coloured graph G is rainbow-connected if any two vertices are connected by a path whose edge...
DOI
Add to ORKG