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

The Linear 2-Arboricity of Planar Graphs

โœ Scribed by Ko-Wei Lih; Li-Da Tong; Wei-Fan Wang

Book ID
106047449
Publisher
Springer Japan
Year
2003
Tongue
English
Weight
114 KB
Volume
19
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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 โˆ† =

On point-linear arboricity of planar gra
On point-linear arboricity of planar graphs
โœ Jianfang Wang ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 220 KB

The point-linear arboricity of a graph G = (V, E), written as p,(G), is defined as p,(G) =min{k / there exists a partition of V into k subsets, V =LJt, V,, such that (V,) is a linear forest for 1 <i <k}. In this paper, we will discuss the point-linear arboricity of planar graphs and obtained follow

The Point-Arboricity of Planar Graphs
The Point-Arboricity of Planar Graphs
โœ Chartrand, G.; Kronk, H. V. ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› Oxford University Press ๐ŸŒ English โš– 127 KB
The linear arboricity of graphs
The linear arboricity of graphs
โœ N. Alon ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› The Hebrew University Magnes Press ๐ŸŒ English โš– 636 KB