Linear arboricity of NIC-planar graphs

DOI10.1007/S10255-019-0865-ZzbMATH Open1433.05232OpenAlexW2996256430WikidataQ126538609 ScholiaQ126538609MaRDI QIDQ2300535FDOQ2300535

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The structure of 1-planar graphs
• 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
• A planar linear arboricity conjecture
• The linear arboricity of planar graphs of maximum degree seven is four
• \(\mathsf{NIC}\)-planar graphs

Cited In (2)

• Title not available (Why is that?)
• 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)