Homomorphisms of Edge-Colored Graphs and Coxeter Groups
Journal of Algebraic Combinatorics: An International Journal
Graph Theory
Rainbow Connection in Graphs with Minimum Degree Three
Combinatorial Algorithms
The rainbow connection of a graph is (at most) reciprocal to its minimum degree
Journal of Graph Theory
| Hi-index | 0.04 |
An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. A graph G is called rainbowk-connected if there is an edge colouring of G with k colours such that G is rainbow connected. In this paper we will study rainbow k-connected graphs with a minimum number of edges. For an integer n=3 and 1@?k@?n-1 let t(n,k) denote the minimum size of a rainbow k-connected graph G of order n. We will compute exact values and upper bounds for t(n,k).