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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
