Hardness result for the total rainbow $k$-connection of graphs

Wenjing Li, Xueliang Li, Di Wu

A path in a total-colored graph is called \emph{total rainbow} if its edges and internal vertices have distinct colors. For an $\ell$-connected graph $G$ and an integer $k$ with $1…