Characterize graphs with rainbow connection number $m-2$ and $m-3$

Xueliang Li, Yuefang Sun, Yan Zhao

A path in an edge-colored graph, where adjacent edges may be colored the same, is a rainbow path if no two edges of it are colored the same. A nontrivial connected graph $G$ is rai…