On total colorings of some special 1-planar graphs (Q2401770)

The total coloring conjecture says that every simple graph of maximum degree \(\Delta\) admits a total \((\Delta+2)\)-coloring. In this paper, the authors prove this conjecture for a certain class of graphs. A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. The total chromatic number \(\chi^{\prime\prime}(G)\) of a graph \(G\) is the least number of colors needed in any total coloring of \(G\). If \(G\) has a total \(k\)-coloring, then \(G\) is called totally \(k\)-colorable. The following theorems are proved. Let \(G\) be a 1-planar graph with maximum degree \(\Delta\) and \(g(G) \geq 4\), and let \(r\) be a positive integer. If \(\Delta \leq r\) and \(r \geq 9\), then \(\chi^{\prime\prime}\leq r + 2\). Let \(G\) be a 1-planar graph with maximum degree \(\Delta\) and \(g(G) \geq 5\), and let \(r\) be a positive integer. If \(\Delta \leq r\) and \(r \geq 7\), then \(\chi^{\prime\prime}\leq r + 2\).