Showing math.COShow all
2 papers · 1 filter
math.CO2020
An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs
Logan A. Smith, David T. Mildebrath, Illya V. Hicks
We present an integer programming model to compute the strong rainbow connection number, , of any simple graph . We introduce several enhancements to the proposed model,…
math.CO2019
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 for cactus graphs in which all cycles have odd length. We present a formula to calculate $src…