✦ LIBER ✦

The Linear Arboricity of Series-Parallel Graphs

✍ Scribed by Jianliang Wu

Book ID: 107706411
Publisher: Springer Japan
Year: 2000
Tongue: English
Weight: 77 KB
Volume: 16
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s373-000-8299-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The linear arboricity of graphs

✍ N. Alon 📂 Article 📅 1988 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 636 KB

Linear Arboricity and Linear k-Arboricit

Linear Arboricity and Linear k-Arboricity of Regular Graphs

✍ Noga Alon; V. J. Teague; N. C. Wormald 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 86 KB

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