Rainbow Connection in Some Digraphs

Abstract

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 133(1):85---98, 2008), and it was extended to oriented graphs by Dorbec et al. (Discrete Appl Math 179(31):69---78, 2014). In this paper we present some results regarding this extension, mostly for the case of circulant digraphs.