Rainbow connection in some digraphs
type: Item
instance of: scholarly article
title: Rainbow connection in some digraphs
zbMATH Open document ID: 1353.05045
author: Jesús Alva-Samos
author: Juan José Montellano-Ballesteros
published in: Graphs and Combinatorics
publication date: 2017-01-13T00:00:00Z
full work available at URL: https://arxiv.org/abs/1504.01721
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 6674423
zbMATH Keywords: arc colouring
zbMATH Keywords: rainbow connected
zbMATH Keywords: connectivity
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2337392520
arXiv ID: 1504.01721
cites work: Digraphs
cites work: Hardness and algorithms for rainbow connection
cites work: Rainbow connection in graphs
cites work: The rainbow connectivity of a graph
cites work: Rainbow connection in oriented graphs
cites work: Bounds for the rainbow connection number of graphs
cites work: Rainbow connection and minimum degree
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 connection number of dense graphs
cites work: A sharp upper bound for the rainbow 2-connection number of a 2-connected graph
cites work: Rainbow connection in 3-connected graphs
cites work: Rainbow connections of graphs: a survey
DOI: 10.1007/S00373-016-1723-X
description: scientific article