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