| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6871570 | Discrete Applied Mathematics | 2018 | 18 Pages |
Abstract
Dorbec, Schiermeyer, Sidorowicz, and Sopena extended the concept of the rainbow connection to digraphs. In this paper, we consider the (strong) total rainbow connection number of digraphs. Results on the (strong) total rainbow connection number of biorientations of graphs, tournaments, and cactus digraphs are presented.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Hui Lei, Henry Liu, Colton Magnant, Yongtang Shi,