Back to Search
Start Over
LINEAR ARBORICITY OF 1-PLANAR GRAPHS.
- Source :
-
Discussiones Mathematicae: Graph Theory . 2024, Vol. 44 Issue 2, p435-457. 23p. - Publication Year :
- 2024
-
Abstract
- The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1981, Akiyama, Exoo and Harary conjectured that ⌈Δ(G)/2⌉ ≤ la(G) ≤ ⌈Δ(G)+1/2 ⌉ for any simple graph G. A graph G is 1-planar if it can be drawn in the plane so that each edge has at most one crossing. In this paper, we confirm the conjecture for 1-planar graphs G with Δ(G) ≥ 13. [ABSTRACT FROM AUTHOR]
- Subjects :
- *LOGICAL prediction
Subjects
Details
- Language :
- English
- ISSN :
- 12343099
- Volume :
- 44
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Discussiones Mathematicae: Graph Theory
- Publication Type :
- Academic Journal
- Accession number :
- 177835984
- Full Text :
- https://doi.org/10.7151/dmgt.2453