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}
}

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