Displaying similar documents to “Tournaments as feedback arc sets.”

Rainbow Connectivity of Cacti and of Some Infinite Digraphs

Jesús Alva-Samos, Juan José Montellano-Ballesteros (2017)

Discussiones Mathematicae Graph Theory

Similarity:

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 connected is called the rainbow connection number of D, denoted rc⃗ (D). A cactus is a digraph where each arc belongs to exactly one directed cycle. In this paper we give sharp upper and lower bounds...

On the complete digraphs which are simply disconnected.

Davide C. Demaria, José Carlos de Souza Kiihl (1991)

Publicacions Matemàtiques

Similarity:

Homotopic methods are employed for the characterization of the complete digraphs which are the composition of non-trivial highly regular tournaments.