A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti

Logan A. Smith, David T. Mildebrath, Illya V. Hicks

We consider the problem of computing the strong rainbow connection number $src(G)$ for cactus graphs $G$ in which all cycles have odd length. We present a formula to calculate $src…