Good upper bounds for the total rainbow connection of graphs

Hui Jiang, Xueliang Li, Yingying Zhang

A total-colored graph is a graph $G$ such that both all edges and all vertices of $G$ are colored. A path in a total-colored graph $G$ is a total rainbow path if its edges and inte…