Rainbow connection in some digraphs
Combinatorics
2015-04-08 v1
Abstract
An edge-coloured graph is {\it rainbow connected} if any two vertices are connected by a path whose edges have distinct colours. This concept was introduced by Chartrand et al. in \cite{ch01}, and it was extended to oriented graphs by Dorbec et al. in \cite{DI}. In this paper we present some results regarding this extention, mostly for the case of circulant digraphs.
Cite
@article{arxiv.1504.01721,
title = {Rainbow connection in some digraphs},
author = {Jesús Alva-Samos and Juan José Montellano-Ballesteros},
journal= {arXiv preprint arXiv:1504.01721},
year = {2015}
}