Strong rainbow connection in digraphs
type: Item
instance of: scholarly article
title: Strong rainbow connection in digraphs
zbMATH Open document ID: 1380.05090
author: Elżbieta Sidorowicz
author: Éric Sopena
published in: Discrete Applied Mathematics
publication date: 2018-02-22T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6842215
zbMATH Keywords: strong rainbow connection
zbMATH Keywords: digraphs
zbMATH Keywords: tournaments
MaRDI profile type: Publication
full work available at URL: j.dam.2017.12.017
OpenAlex ID: W2417258941
cites work: Rainbow connectivity of cacti and of some infinite digraphs
cites work: Rainbow connection in some digraphs
cites work: Rainbow connectivity: hardness and tractability
cites work: Q5422499
cites work: On rainbow connection
cites work: Hardness and algorithms for rainbow connection
cites work: Rainbow connection in graphs
cites work: Rainbow connection in oriented graphs
cites work: The rainbow connection number of 2-connected graphs
cites work: Graphs with rainbow connection number two
cites work: The rainbow connection of a graph is (at most) reciprocal to its minimum degree
cites work: Rainbow connections of graphs: a survey
cites work: Rainbow Connection in Graphs with Minimum Degree Three
cites work: On minimally rainbow \(k\)-connected graphs
cites work: Rainbow connection and minimum degree
DOI: 10.1016/J.DAM.2017.12.017
description: scientific article; zbMATH DE number 6842215