The Linear Arboricity of IC-planar Graphs
The linear arboricity of a graph is the minimum number of linear forests that partition the edges of . In 1981, Akiyama, Exoo and Harary conjectured that for any simple graph . A graph is 1-planar if it can be drawn in the plane so that each edge has at most one crossing. An IC-planar graph is a 1-planar graph satisfying the condition that each vertex is incident with at most one crossing edge. It is shown in this paper that every IC-planar graph with maximum degree has .
Authors
- Juan Liu (ORCID: https://orcid.org/0000-0003-0857-3877)
- Yongjie Li (ORCID: https://orcid.org/0000-0003-4811-3947)
- Haoying Yuan
Institutions
- Jiangxi Science and Technology Normal University (CN)
- Nanchang Normal University (CN)
Publication Details
- Journal
- Scientific journal of intelligent systems research.
- Published
- 2024-09-01
- DOI
- https://doi.org/10.54691/weh1rn52
- Citations
- 1
- Primary Topic
- Cellular Automata and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.36
Funders
- National Natural Science Foundation of China
- Education Department of Jiangxi Province
- Jiangxi Science and Technology Normal University