The Dn,m (r, c)-digraphs are closely related to the proximity graphs of Jaromczyk and Toussaint (1992) and might be considered as a special case of covering sets of Tuza (1994) and intersection digraphs of Sen et al. (1989).
The Distribution of the Domination Number of a Family of Random Interval Catch Digraphs
In , Caro, Lev, Roditty, Tuza and Yuster investigated the extremal graph-theoretic behavior of rainbow connection number.
Rainbow connections of graphs -- A survey
In , Caro, Lev, Roditty, Tuza and Yuster also derived a result which gives an upper bound for rainbow connection number according to the order and the number of vertexdisjoint cycles.
Rainbow connections of graphs -- A survey
For example, in Caro, Lev, Roditty, Tuza and Yuster derived Theorem 2.23 according to the ear-decomposition of a 2-connected graph.
Rainbow connections of graphs -- A survey
In , Caro, Lev, Roditty, Tuza and Yuster investigated the graphs with small rainbow connection numbers, and they gave a suﬃcient condition that guarantees rc(G) = 2.
Rainbow connections of graphs -- A survey
***