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

The linear arboricity of planar graphs with no short cycles

โœ Scribed by Jian-Liang Wu; Jian-Feng Hou; Gui-Zhen Liu


Book ID
108281330
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
186 KB
Volume
381
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The Linear 2-Arboricity of Planar Graphs
โœ Ko-Wei Lih; Li-Da Tong; Wei-Fan Wang ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 114 KB
On the linear arboricity of planar graph
โœ 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 โˆ† =