On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms

  • Kei Uchizawa
  • Takanori Aoki
  • Takehiro Ito
  • Akira Suzuki
  • Xiao Zhou
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6842)

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( logn).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. Society for Industrial and Applied Mathematics, Philadelphia (1999)CrossRefMATHGoogle Scholar
  2. 2.
    Chakraborty, S., Fischer, E., Matsliah, A., Yuster, R.: Hardness and algorithms for rainbow connection. J.Combinatorial Optimization 21, 330–347 (2011)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Chartrand, G., Johns, G.L., McKeon, K.A., Zhang, P.: Rainbow connection in graphs. Mathematica Bohemica 133, 85–98 (2008)MathSciNetMATHGoogle Scholar
  4. 4.
    Chartrand, C., Johns, G.L., McKeon, K.A., Zhang, P.: The rainbow connectivity of a graph. Networks 54, 75–81 (2009)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Chen, L., Li, X., Shi, Y.: The complexity of determining the rainbow vertex-connection of graphs, arXiv:1101.3126v1 (submitted on January 17, 2011)Google Scholar
  6. 6.
    Caro, Y., Lev, A., Roditty, Y., Tuza, Z., Yuster, R.: On rainbow connectivity. The Electronic Journal of Combinatorics 15, R57 (2008)MATHGoogle Scholar
  7. 7.
    Fellows, M.R., Guo, J., Kanj, I.: The parameterized complexity of some minimum label problems. J. Computer and System Sciences 76, 727–740 (2010)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)MATHGoogle Scholar
  9. 9.
    Krivelevich, M., Yuster, R.: The rainbow connection of a graph is (at most) reciprocal to its minimum degree. J. Graph Theory 63, 185–191 (2010)MathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Kei Uchizawa
    • 1
  • Takanori Aoki
    • 1
  • Takehiro Ito
    • 1
  • Akira Suzuki
    • 1
  • Xiao Zhou
    • 1
  1. 1.Graduate School of Information SciencesTohoku UniversitySendaiJapan

Personalised recommendations