On the rainbow connectivity of graphs: complexity and FPT algorithms

  • Authors:

  • Kei Uchizawa;Takanori Aoki;Takehiro Ito;Akira Suzuki;Xiao Zhou

  • Affiliations:

  • Graduate School of Information Sciences, Tohoku University, Sendai, Japan;Graduate School of Information Sciences, Tohoku University, Sendai, Japan;Graduate School of Information Sciences, Tohoku University, Sendai, Japan;Graduate School of Information Sciences, Tohoku University, Sendai, Japan;Graduate School of Information Sciences, Tohoku University, Sendai, Japan

  • Venue:
  • COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

For a graph G = (V, E) and a color set C, let f : E → C be an edge-coloring of G which is not necessarily proper. Then, the graph G edge-colored by f is rainbow connected if every two vertices of G has a path in which all edges are assigned distinct colors. Chakraborty et al. defined the problem of determining whether the graph colored by a given edge-coloring is rainbow connected. Chen et al. introduced the vertex-coloring version of the problem as a variant, and we introduce the total-coloring version in this paper. We settle the precise computational complexities of all the three problems from two viewpoints, namely, graph diameters and certain graph classes. We also give FPT algorithms for the three problems on general graphs when parameterized by the number of colors in C; these results imply that all the three problems can be solved in polynomial time for any graph with n vertices if |C| = O(log n).