Generalized rainbow connectivity of graphs

Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)


Let C = {c1, c2, ..., ck} be a set of k colors, and let ℓ = (ℓ1, ℓ2, ..., ℓk) be a k-tuple of nonnegative integers ℓ1, ℓ2, ..., ℓk. For a graph G = (V,E), let f: E → C be an edge-coloring of G in which two adjacent edges may have the same color. Then, the graph G edge-colored by f is ℓ-rainbow connected if every two vertices of G have a path P such that the number of edges in P that are colored with cj is at most ℓj for each index j ∈{1,2,..., k}. Given a k-tuple ℓ and an edge-colored graph, we study the problem of determining whether the edge-colored graph is ℓ-rainbow connected. In this paper, we characterize the computational complexity of the problem with regards to certain graph classes: the problem is NP-complete even for cacti, while is solvable in polynomial time for trees. We then give an FPT algorithm for general graphs when parameterized by both k and ℓmax = max{ℓj | 1 ≤ j ≤ k}.

Original languageEnglish
Title of host publicationWALCOM
Subtitle of host publicationAlgorithms and Computation - 7th International Workshop, WALCOM 2013, Proceedings
Number of pages12
Publication statusPublished - 2013
Event7th International Workshop on Algorithms and Computation, WALCOM 2013 - Kharagpur, India
Duration: 2013 Feb 142013 Feb 16

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7748 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference7th International Workshop on Algorithms and Computation, WALCOM 2013


Dive into the research topics of 'Generalized rainbow connectivity of graphs'. Together they form a unique fingerprint.

Cite this