Strong Rainbow Connection in Digraphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2018

Strong Rainbow Connection in Digraphs

Résumé

An arc-coloured digraph is strongly rainbow connected if for every pair of vertices (u, v) there exists a shortest path from u to v all of whose arcs have different colours. The strong rainbow connection number of a digraph is the minimum number of colours needed to make the graph strongly rainbow connected. In this paper, we study the strong rainbow connection number of minimally strongly connected connected digraphs, non-Hamiltonian strong digraphs and strong tournaments.
Fichier non déposé

Dates et versions

hal-01330533 , version 1 (11-06-2016)

Identifiants

  • HAL Id : hal-01330533 , version 1

Citer

Elzbieta Sidorowicz, Eric Sopena. Strong Rainbow Connection in Digraphs. Discrete Applied Mathematics, 2018, 238, pp.133-143. ⟨hal-01330533⟩

Collections

CNRS TDS-MACS
71 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More