List Point Arboricity of Dense Graphs
β Scribed by Lingyan Zhen; Baoyindureng Wu
- Book ID
- 106047770
- Publisher
- Springer Japan
- Year
- 2009
- Tongue
- English
- Weight
- 118 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract In this paper, we study the critical pointβarboricity graphs. We prove two lower bounds for the number of edges of __k__βcritical pointβarboricity graphs. A theorem of Kronk is extended by proving that the pointβarboricity of a graph __G__ embedded on a surface __S__ with Euler genus __
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