𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Point Arboricity Critical Graphs Exist
✍ Bollobas, B.; Harary, F. πŸ“‚ Article πŸ“… 1975 πŸ› Oxford University Press 🌐 English βš– 142 KB
The Point-Arboricity of Planar Graphs
✍ Chartrand, G.; Kronk, H. V. πŸ“‚ Article πŸ“… 1969 πŸ› Oxford University Press 🌐 English βš– 127 KB
On the critical point-arboricity graphs
✍ Riste Ε krekovski πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 155 KB

## 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 __

On point-linear arboricity of planar gra
✍ 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