𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Vertex and Tree Arboricities of Graphs

✍ Scribed by Gerard J. Chang; Chiuyuan Chen; Yaping Chen


Book ID
111592097
Publisher
Springer US
Year
2004
Tongue
English
Weight
129 KB
Volume
8
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Equitable vertex arboricity of graphs
✍ Wu, Jian-Liang; Zhang, Xin; Li, Hailuan πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 380 KB
On linear vertex-arboricity of complemen
✍ Yousef Alavi; Jiuqiang Liu; Jianfang Wang πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 323 KB πŸ‘ 1 views

## Abstract The linear vertex‐arboricity ρ(__G__) of a graph __G__ is defined to be the minimum number of subsets into which the vertex set of __G__ can be partitioned such that each subset induces a linear forest. In this paper, we give the sharp upper and lower bounds for the sum and product of l

On the linear vertex-arboricity of a pla
✍ K. S. Poh πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 153 KB πŸ‘ 2 views

## Abstract We prove in this note that the linear vertex‐arboricity of any planar graph is at most three, which confirms a conjecture due to Broere and Mynhardt, and others.