Generalized rainbow connectivity of graphs
type: Item
instance of: scholarly article
title: Generalized rainbow connectivity of graphs
zbMATH Open document ID: 1305.05116
author: Kei Uchizawa
author: Takanori Aoki
author: Takehiro Ito
author: Xiao Zhou
published in: Theoretical Computer Science
publication date: 2014-10-06T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6351405
zbMATH Keywords: cactus
zbMATH Keywords: fixed parameter tractability
zbMATH Keywords: graph algorithm
zbMATH Keywords: rainbow connectivity
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.01.007
OpenAlex ID: W2140424448
cites work: Color-coding
cites work: Rainbow connectivity: hardness and tractability
cites work: Graph Classes: A Survey
cites work: Hardness and algorithms for rainbow connection
cites work: Rainbow connection number and connected dominating sets
cites work: Rainbow connection in graphs
cites work: The rainbow connectivity of a graph
cites work: On rainbow connection
cites work: The parameterized complexity of some minimum label problems
cites work: Q4198056
cites work: The rainbow connection of a graph is (at most) reciprocal to its minimum degree
cites work: On the rainbow connectivity of graphs: complexity and FPT algorithms
cites work: Generalized Rainbow Connectivity of Graphs
DOI: 10.1016/J.TCS.2014.01.007
description: scientific article; zbMATH DE number 6351405