Sufficient conditions for 2-rainbow connected graphs
type: Item
instance of: scholarly article
title: Sufficient conditions for 2-rainbow connected graphs
zbMATH Open document ID: 1339.05139
author: Arnfried Kemnitz
author: Ingo Schiermeyer
published in: Discrete Applied Mathematics
publication date: 2016-06-21T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6595962
zbMATH Keywords: rainbow colouring
zbMATH Keywords: rainbow connected
MaRDI profile type: Publication
full work available at URL: j.dam.2015.10.025
OpenAlex ID: W2100509599
cites work: Q5422499
cites work: On rainbow connection
cites work: Hardness and Algorithms for Rainbow Connectivity
cites work: Rainbow connection in graphs
cites work: On Representatives of Subsets
cites work: Rainbow connection in sparse 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 connection number of dense graphs
cites work: Rainbow Connection in Graphs with Minimum Degree Three
DOI: 10.1016/J.DAM.2015.10.025
description: scientific article; zbMATH DE number 6595962