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.
Similar content being viewed by others
References
Akiyama, J., Exoo, G., Harary, F. Covering and packing in graphs III: Cyclic and acyclic invariants. Math. Slovaca, 30: 405–417 (1980)
Albertson, M.O. Chromatic number, independence ratio, and crossing number. Ars Math. Contemp., 1(1): 1–6 (2008)
Bachmaier, C., Brandenburg, F.J., Hanauer, K., Neuwirth, D., Reislhuber, J. NIC-planar graphs. Discrete Appl. Math., 232: 23–40 (2017)
Bondy, J.A., Murty, U.S.R. Graph Theory, Springer, GTM 244, 2008, ISBN: 978-1-84628-969-9
Cygan, M., Hou, J., Kowalik, L. Lužar, B., Wu, J.L. A planar linear arboricity. J. Graph Theory, 69(4): 403–425 (2012)
Fabrici, I., Madaras, T. The structure of 1-planar graphs. Discrete Math., 307: 854–865 (2007)
Ringel, G. Ein sechsfarbenproblem auf der Kugel. Abh. Math. Semin. Univ. Hambg., 267: 120–130 (2019)
Liu, J., Hu, X., Wang, W., Wang, Y. Light structure in 1-planar graphs with an application to linear 2-arboricity. Discrete Appl. Math., 232: 23–40 (2017)
Wu, J.L. On the linear arboricity of planar graphs. J. Graph Theory, 31: 129–134 (1999)
Wu, J.L., Wu, Y. The linear arboricity of planar graphs of maximum degree seven are four. J. Graph Theory, 58: 210–220 (2008)
Zhang, X. Drawing complete multipartite graphs on the plane with restrictions on crossings. Acta Math. Sin. (Engl. Ser.), 30(12): 2045–2053 (2014)
Zhang, X., Liu, G., Wu, J.L. On the linear arboricity of 1-planar graphs. OR Trans., 15(3): 38–44 (2011)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China (Nos.11871055, 11301410), the Natural Science Basic Research Plan in Shaanxi Province of China (No.2017JM1010) and the Fundamental Research Funds for the Central Universities (Nos. JB170706).
Rights and permissions
About this article
Cite this article
Niu, B., Zhang, X. Linear Arboricity of NIC-Planar Graphs. Acta Math. Appl. Sin. Engl. Ser. 35, 924–934 (2019). https://doi.org/10.1007/s10255-019-0865-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10255-019-0865-z