Rainbow connection and minimum degree

Authors:
Ingo Schiermeyer
Affiliations:
-
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 3
Cited 0

Graph Theory

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

Quantified Score

Hi-index	0.04

Visualization

Abstract

An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order to make G rainbow connected. Krivelevich and Yuster (2010) [5] have shown that a connected graph G with n vertices has rc(G)