Back to Search
Start Over
The linear 2-arboricity of 1-planar graphs without 3-cycles.
- Source :
- Discrete Mathematics, Algorithms & Applications; Dec2021, Vol. 13 Issue 6, p1-20, 20p
- Publication Year :
- 2021
-
Abstract
- The linear 2-arboricity la 2 (G) of a graph G is the least integer k such that G can be partitioned into k edge-disjoint forests, whose component trees are paths of length at most 2. In this paper, we prove that if G is a 1-planar graph without 3-cycles and with maximum degree Δ , then la 2 (G) ≤ ⌈ Δ + 1 2 ⌉ + 6. [ABSTRACT FROM AUTHOR]
- Subjects :
- PLANAR graphs
INTEGERS
TREES
Subjects
Details
- Language :
- English
- ISSN :
- 17938309
- Volume :
- 13
- Issue :
- 6
- Database :
- Complementary Index
- Journal :
- Discrete Mathematics, Algorithms & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 154042137
- Full Text :
- https://doi.org/10.1142/S1793830921500786