Rainbow Connectivity of Cacti and of Some Infinite Digraphs
An arc-coloured digraph D = (V,A) is said to be rainbow connected if for every pair {u, v} ⊆ V there is a directed uv-path all whose arcs have different colours and a directed vu-path all whose arcs have different colours. The minimum number of colours required to make the digraph D rainbow connecte...
Main Authors: | Alva-Samos Jesús, Montellano-Ballesteros Juan José |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2017-05-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1953 |
Similar Items
-
Rainbow Connection In Sparse Graphs
by: Kemnitz Arnfried, et al.
Published: (2013-03-01) -
Cacti : the flowering desert /
by: 316168 Smit, Daan, et al.
Published: (1996) -
Proper Rainbow Connection Number of Graphs
by: Doan Trung Duy, et al.
Published: (2021-08-01) -
The k-Rainbow Bondage Number of a Digraph
by: Amjadi Jafar, et al.
Published: (2015-05-01) -
Rainbow Connection Number of Dense Graphs
by: Li Xueliang, et al.
Published: (2013-07-01)