An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. This concept was introduced by Chartrand et al. (Math Bohemica… (More)

An arc-coloured digraph D = (V,A) is said to be rainbow connected if for every pair {u, v} ⊆ V there is a directed uv-path all whose arcs have different colours and a directed vu-path all whose arcs… (More)