# Algorithms and Bounds for Very Strong Rainbow Coloring

@article{Chandran2018AlgorithmsAB,
title={Algorithms and Bounds for Very Strong Rainbow Coloring},
author={L. Chandran and Anita Das and D. Issac and E. V. Leeuwen},
journal={ArXiv},
year={2018},
volume={abs/1703.00236}
}
• L. Chandran, +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

#### References

SHOWING 1-10 OF 34 REFERENCES
On the Complexity of Rainbow Coloring Problems
• Mathematics, Computer Science
• Discret. Appl. Math.
• 2018
• 13
• PDF
Hardness and algorithms for rainbow connection
• Mathematics, Computer Science
• J. Comb. Optim.
• 2011
• 162
• PDF
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms
• Mathematics, Computer Science
• Algorithmica
• 2012
• 31
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs
• Computer Science, Mathematics
• Discret. Math. Theor. Comput. Sci.
• 2018
• 5
• PDF
On the fine-grained complexity of rainbow coloring
• Mathematics, Computer Science
• ESA
• 2016
• 4
• PDF
Rainbow Connectivity: Hardness and Tractability
• Mathematics, Computer Science
• FSTTCS
• 2011
• 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
• Mathematics, Computer Science
• J. Graph Theory
• 2012
• 83
• PDF