Algorithms and Bounds for Very Strong Rainbow Coloring

  title={Algorithms and Bounds for Very Strong Rainbow Coloring},
  author={L. Chandran and Anita Das and D. Issac and E. V. Leeuwen},
  • L. Chandran, Anita Das, +1 author E. V. Leeuwen
  • Published 2018
  • Computer Science, Mathematics
  • ArXiv
  • A well-studied coloring problem is to assign colors to the edges of a graph G so that, for every pair of vertices, all edges of at least one shortest path between them receive different colors. The minimum number of colors necessary in such a coloring is the strong rainbow connection number (\(\mathbf {src}(G)\)) of the graph. When proving upper bounds on \(\mathbf {src}(G)\), it is natural to prove that a coloring exists where, for every shortest path between every pair of vertices in the… CONTINUE READING
    2 Citations
    An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs
    • PDF
    Split-Decomposition Trees with Prime Nodes: Enumeration and Random Generation of Cactus Graphs
    • 1
    • PDF


    On the Complexity of Rainbow Coloring Problems
    • 13
    • PDF
    Hardness and algorithms for rainbow connection
    • 162
    • PDF
    On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms
    • 31
    Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs
    • 5
    • PDF
    On the fine-grained complexity of rainbow coloring
    • 4
    • PDF
    Rainbow Connectivity: Hardness and Tractability
    • 26
    • Highly Influential
    • PDF
    Further hardness results on rainbow and strong rainbow connectivity
    • J. Lauri
    • Mathematics, Computer Science
    • Discret. Appl. Math.
    • 2016
    • 13
    • PDF
    Rainbow connection number and connected dominating sets
    • 83
    • PDF
    Rainbow Connection Number and Radius
    • 40
    • PDF