On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms


For a graph G=(V,E) and a color set C, 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 in which all edges are assigned distinct colors. Chakraborty et al. defined the problem of determining whether the graph colored by a… (More)
DOI: 10.1007/s00453-012-9689-4

10 Figures and Tables


  • Presentations referencing similar topics