Name
Abstract | ||
|---|---|---|
The linear 2-arboricity la2(G) of a graph G is the least integer k such that G can be partitioned into k edge-disjoint forests, whose components are paths of length at most 2. In this paper, we prove that every planar graph G with =10 has la2(G)9. Using this result, we correct an error in the proof of a result in Wang (2016), which says that every planar graph G satisfies la2(G)(+1)2+6. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.disc.2017.01.027 | Discrete Mathematics |
Keywords | Field | DocType |
Planar graph,Linear 2-arboricity,Maximum degree,Edge-partition | Discrete mathematics,Graph toughness,Outerplanar graph,Combinatorics,Bound graph,Graph power,Planar straight-line graph,Graph minor,Arboricity,Planar graph,Mathematics | Journal |
Volume | Issue | ISSN |
340 | 7 | 0012-365X |
Citations | PageRank | References |
1 | 0.38 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yiqiao Wang | 1 | 494 | 42.81 |
| Xiaoxue Hu | 2 | 7 | 4.25 |
| Weifan Wang | 3 | 868 | 89.92 |