Linear arboricity of NIC-planar graphs

DOI10.1007/S10255-019-0865-ZMaRDI QIDQ2300535zbMATH OpenOpenAlexWikidataFDO

Authors Bei Niu, Xin Zhang

Publication date 27 February 2020

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10255-019-0865-z

zbMATH Keywords

light edgelinear arboricityNIC-planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• \(\mathsf{NIC}\)-planar graphs
• The linear 2-arboricity of IC-planar graphs
• A result on linear arboricity of planar graphs.
• New results on edge partitions of 1-plane graphs
• Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions

Cites work

• scientific article; zbMATH DE number 3717365 (Why is no real title available?)
• scientific article; zbMATH DE number 1299961 (Why is no real title available?)
• Chromatic number, independence ratio, and crossing number
• Drawing complete multipartite graphs on the plane with restrictions on crossings
• On the linear arboricity of 1-planar graphs
• The linear arboricity of planar graphs of maximum degree seven is four
• The structure of 1-planar graphs
• \(\mathsf{NIC}\)-planar graphs

Cited in

(3)

• The structure and the bondage number of three classes of beyond-planar graphs
• \(\mathsf{NIC}\)-planar graphs
• On \((p, 1)\)-total labelling of NIC-planar graphs

This page was built for publication: Linear arboricity of NIC-planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300535)