The rainbow $k$-connectivity of two classes of graphs

Xueliang Li, Yuefang Sun

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