1 Answers
In graph theory, a total coloring is a coloring on the vertices and edges of a graph such that:
. no adjacent vertices have the same color;
. no adjacent edges have the same color; and
. no edge and its endvertices are assigned the same color.
9 views
Answered