An Intermediate Value Theorem for the Arboricities
Let G be a graph. The vertex (edge) arboricity of G denoted by a(G) (a1(G)) is the minimum number of subsets into which the vertex (edge) set of G can be partitioned so that each subset induces an acyclic subgraph. Let d be a graphical sequence and let R(d) be the class of realizations of d. We prov...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2011-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2011/947151 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|