On total colorings of 1-planar graphs
Zhang, Xin · Hou, Jianfeng · Liu, Guizhen
Original · EN
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. In this paper, we confirm the total-coloring conjecture for 1-planar graphs with maximum degree at least 13.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.