Strong Rainbow Connection in Digraphs
Résumé
An arc-coloured digraph is strongly rainbow connected if for every pair of vertices (u, v) there exists a shortest path from u to v all of whose arcs have different colours. The strong rainbow connection number of a digraph is the minimum number of colours needed to make the graph strongly rainbow connected.
In this paper, we study the strong rainbow connection number of minimally strongly connected connected digraphs, non-Hamiltonian strong digraphs and strong tournaments.