1 paper
Hui Jiang, Xueliang Li, Yingying Zhang
A graph is said to be {\it total-colored} if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a {\it total monochromatically-connecting color…