On total colorings of 1-planar graphs
classification
🧮 math.CO
cs.DM
keywords
planaredgegraphscoloringsconfirmconjecturecrosseddegree
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.