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 prove that every 1-planar graph G with maximum degree Δ(G) ≥ 12 and girth at least five is totally (Δ(G) + 1)-colorable.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
