𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Equitable vertex arboricity of graphs

✍ Scribed by Wu, Jian-Liang; Zhang, Xin; Li, Hailuan


Book ID
121260806
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
380 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Vertex equitable labeling of graphs
✍ Seenivasan, M.; Lourdusamy, A. πŸ“‚ Article πŸ“… 2008 πŸ› Informa UK (Taylor & Francis) 🌐 English βš– 200 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

Vertex and Tree Arboricities of Graphs
✍ Gerard J. Chang; Chiuyuan Chen; Yaping Chen πŸ“‚ Article πŸ“… 2004 πŸ› Springer US 🌐 English βš– 129 KB