Total coloring

Total coloring is a concept in graph theory that combines both vertex coloring and edge coloring. In a total coloring of a graph, each vertex and each edge is assigned a color such that no two adjacent vertices (connected by an edge) share the same color, and no edge that is incident to a vertex can share the same color with that vertex.