Graphs and combinatorics, 2016-11, Vol.32 (6), p.2199-2209
2016
Volltextzugriff (PDF)
Details
- Autor(en) / Beteiligte
- Titel
- Rainbow Connection in Some Digraphs
- Ist Teil von
- Graphs and combinatorics, 2016-11, Vol.32 (6), p.2199-2209
- Ort / Verlag
- Tokyo: Springer Japan
- Erscheinungsjahr
- 2016
- Quelle
- springer (창간호~2014)
- Beschreibungen/Notizen
- 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.
- Sprache
- Englisch
- Identifikatoren
- ISSN: 0911-0119eISSN: 1435-5914DOI: 10.1007/s00373-016-1723-xTitel-ID: cdi_proquest_miscellaneous_1855382001
- Format
- –
- Schlagworte
- Color, Colour, Combinatorial analysis, Combinatorics, Engineering Design, Graph theory, Graphs, Mathematics, Mathematics and Statistics, Original Paper, Rainbows