Total coloring
Материал из WikiGrapp
Total coloring --- тотальная раскраска.
The total coloring of a graph [math]\displaystyle{ G }[/math] is a coloring of its vertices and edges in which any two adjacent or incident elements of [math]\displaystyle{ V(G) \cup E(G) }[/math] are colored with different colors. The minimal number of colors required for this coloring is called the total chromatic number and is denoted by [math]\displaystyle{ \chi_{t}(G) }[/math].
