Name
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. We prove that la2(G) less than or equal to [(Delta(G) + 4)/2] if G is an outerplanar graph with maximum degree Delta(G). |
Year | Venue | Keywords |
|---|---|---|
2004 | ARS COMBINATORIA | outerplanar graph |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Outerplanar graph,Partial k-tree,Book embedding,Pathwidth,Arboricity,1-planar graph,Pancyclic graph,Mathematics,Dense graph | Journal | 73 |
ISSN | Citations | PageRank |
0381-7032 | 1 | 0.38 |
References | Authors | |
0 | 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 |