𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some problems about linear arboricity

✍ Scribed by M. Habib; B. Peroche

Book ID
103057694
Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
184 KB
Volume
41
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

We present here a conjecture on partitioning the edges of a graph tnto k-linear whose connected components are paths of length less or equ:,l to A).

forests (forest

πŸ“œ SIMILAR VOLUMES

Some results on linear arboricity
Some results on linear arboricity
✍ Filip Guldan πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 194 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

Some problems about belief
Some problems about belief
✍ Wilfrid Sellars πŸ“‚ Article πŸ“… 1968 πŸ› Springer Netherlands 🌐 English βš– 874 KB
Some Problems About Affectivity
Some Problems About Affectivity
✍ Michael Stocker πŸ“‚ Article πŸ“… 2002 πŸ› Springer Netherlands 🌐 English βš– 52 KB