𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic

✍ Scribed by Wu, Jian-Liang

Book ID
118197208
Publisher
Society for Industrial and Applied Mathematics
Year
2009
Tongue
English
Weight
152 KB
Volume
23
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The linear arboricity of graphs
The linear arboricity of graphs
✍ N. Alon πŸ“‚ Article πŸ“… 1988 πŸ› The Hebrew University Magnes Press 🌐 English βš– 636 KB
On the linear arboricity of planar graph
On the linear arboricity of planar graphs
✍ Wu, Jian-Liang πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 188 KB πŸ‘ 2 views

The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. Akiyama, Exoo, and Harary conjectured for any simple graph G with maximum degree βˆ†. The conjecture has been proved to be true for graphs having βˆ† =

On point-linear arboricity of planar gra
On point-linear arboricity of planar graphs
✍ Jianfang Wang πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 220 KB

The point-linear arboricity of a graph G = (V, E), written as p,(G), is defined as p,(G) =min{k / there exists a partition of V into k subsets, V =LJt, V,, such that (V,) is a linear forest for 1 <i <k}. In this paper, we will discuss the point-linear arboricity of planar graphs and obtained follow

On linear vertex-arboricity of complemen
On linear vertex-arboricity of complementary graphs
✍ Yousef Alavi; Jiuqiang Liu; Jianfang Wang πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 323 KB πŸ‘ 1 views

## Abstract The linear vertex‐arboricity ρ(__G__) of a graph __G__ is defined to be the minimum number of subsets into which the vertex set of __G__ can be partitioned such that each subset induces a linear forest. In this paper, we give the sharp upper and lower bounds for the sum and product of l

On the linear k-arboricity of cubic grap
On the linear k-arboricity of cubic graphs
✍ Bill Jackson; Nicholas C. Wormald πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 231 KB

Bermond et al. [2] conjectured that the edge set of a cubic graph G can be partitioned into two k-linear forests, that is to say two forests whose connected components are paths of length at most k, for all k >/5. We shall prove a weaker result that the statement is valid for all k/> 18. All graphs