Abstract
A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. It is proved that every NIC-planar graph with minimum degree at least 2 (resp. 3) contains either an edge with degree sum at most 23 (resp. 17) or a 2-alternating cycle (resp. 3-alternating quadrilateral). By applying those structural theorems, we confirm the Linear Arboricity Conjecture for NIC-planar graphs with maximum degree at least 14 and determine the linear arboricity of NIC-planar graphs with maximum degree at least 21.
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 callMore From: Acta Mathematicae Applicatae Sinica, English Series
Disclaimer: 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.
