1 paper
Petros A. Petrosyan, Nerses A. Khachatryan
A total coloring of a graph G is a coloring of its vertices and edges such that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. An interval…