Name
Abstract | ||
|---|---|---|
. Let G be a planar graph with maximum degree Δ and girth g. The linear 2-arboricity la
2(G) of 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. We prove that (1) la
2(G)≤⌈(Δ+1)/2⌉+12; (2) la
2(G)≤⌈(Δ+1)/2⌉+6 if g≥4; (3) la
2(G)≤⌈(Δ+1)/2⌉+2 if g≥5; (4) la
2(G)≤⌈(Δ+1)/2⌉+1 if g≥7. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/s00373-002-0504-x | Graphs and Combinatorics |
Keywords | Field | DocType |
maximum degree,planar graph | Integer,Topology,Discrete mathematics,Combinatorics,Degree (graph theory),Arboricity,Mathematics,Planar graph | Journal |
Volume | Issue | ISSN |
19 | 2 | 0911-0119 |
Citations | PageRank | References |
12 | 0.87 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ko-wei Lih | 1 | 529 | 58.80 |
| Li-da Tong | 2 | 46 | 12.49 |
| Weifan Wang | 3 | 868 | 89.92 |