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. in ch01, and it was extended to oriented graphs by Dorbec et al. in DI. In this paper we present some results regarding this extention, mostly for the case of circulant digraphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.