✦ LIBER ✦

Covering and packing in graphs IV: Linear arboricity

✍ Scribed by Jin Akiyama; Geoffrey Exoo; Frank Harary

Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 192 KB
Volume: 11
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230110108

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing and covering dense graphs

✍ Noga Alon; Yair Caro; Raphael Yuster 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB 👁 1 views

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

Linear arboricity for graphs with multip

Linear arboricity for graphs with multiple edges

✍ Houria Aït-djafer 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB

Akiyama, Exoo, and Harary conjectured that for any simple graph G with maximum degree A(G). the linear arboricity / a ( G ) satisfies rA(G)/21 5 /a(G) 5 r(A(G) + 11/21, Here it is proved that if G is a loopless graph with maximum degree A ( G ) S k and maximum edge multiplicity ## 1. Introduction

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

List strong linear 2-arboricity of spars

List strong linear 2-arboricity of sparse graphs

✍ Oleg V. Borodin; Anna O. Ivanova 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB 👁 2 views

The linear arboricity of planar graphs o

The linear arboricity of planar graphs of maximum degree seven is four

✍ Jian-Liang Wu; Yu-Wen Wu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

## Abstract The linear arboricity of a graph __G__ is the minimum number of linear forests which partition the edges of __G__. Akiyama et al. conjectured that $\lceil {\Delta {({G})}\over {2}}\rceil \leq {la}({G}) \leq \lceil {\Delta({G})+{1}\over {2}}\rceil$ for any simple graph __G__. Wu wu prove