Linear arboricity of NIC-planar graphs
From MaRDI portal
Publication:2300535
DOI10.1007/s10255-019-0865-zzbMath1433.05232OpenAlexW2996256430WikidataQ126538609 ScholiaQ126538609MaRDI QIDQ2300535
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (2)
Cites Work
- Drawing complete multipartite graphs on the plane with restrictions on crossings
- The structure of 1-planar graphs
- \(\mathsf{NIC}\)-planar graphs
- A Planar linear arboricity conjecture
- The linear arboricity of planar graphs of maximum degree seven is four
- Chromatic number, independence ratio, and crossing number
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Linear arboricity of NIC-planar graphs