Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs

Wenjing Li, Xueliang Li, Colton Magnant +1

A graph is said to be \emph{total-colored} if all the edges and the vertices of the graph are colored. A total-colored graph is \emph{total-rainbow connected} if any two vertices o…