𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The linear arboricity of graphs

✍ Scribed by N. Alon

Book ID
112891802
Publisher
The Hebrew University Magnes Press
Year
1988
Tongue
English
Weight
636 KB
Volume
62
Category
Article
ISSN
0021-2172

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Linear 2-Arboricity of Planar Graphs
The Linear 2-Arboricity of Planar Graphs
✍ Ko-Wei Lih; Li-Da Tong; Wei-Fan Wang πŸ“‚ Article πŸ“… 2003 πŸ› Springer Japan 🌐 English βš– 114 KB
The linear arboricity of some regular gr
The linear arboricity of some regular graphs
✍ Hikoe Enomoto; Bernard PΓ©roche πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 582 KB

W e prove that the linear arboricity of every 5-regular graph is 3. That is, the edges of any 5-regular graph are covered by three linear forests. W e also determine the linear arboricity of 6-regular graphs and 8-regular graphs. These results improve the known upper bounds for the linear arboricity

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 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