Total coloring;
survey;
planar graph;
product graphs;
non-planar graphs;
TOTAL-CHROMATIC NUMBER;
COMPLETE MULTIPARTITE GRAPHS;
LIST TOTAL COLORINGS;
MAXIMUM DEGREE 6;
PLANAR GRAPHS;
REGULAR GRAPHS;
DIRECT-PRODUCT;
EDGE;
ADJACENT;
VERTEX;
D O I:
10.1080/09728600.2023.2187960
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
The smallest integerkneeded for the assignment ofkcolors to the elements so that the coloringis proper (vertices and edges) is called the total chromatic number of a graph. Vizing [126] andBehzad [6,7] conjectured that the total coloring can be done using at most delta(G) + 2 colors,where delta(G) is the maximum degree ofG. It is not settled even for planar graphs. In this paper,we give a survey on the total coloring of graphs.