๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The linear arboricity of planar graphs with maximum degree at least 5

โœ Scribed by Hong-Yu Chen; Jian-Ming Qi


Book ID
116577128
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
161 KB
Volume
112
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The linear arboricity of planar graphs o
โœ 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