Back to Search
Start Over
Circular vertex arboricity
- Source :
-
Discrete Applied Mathematics . Jul2011, Vol. 159 Issue 12, p1231-1238. 8p. - Publication Year :
- 2011
-
Abstract
- Abstract: The vertex arboricity of graph is defined as the minimum of subsets in a partition of the vertex set of so that each subset induces an acyclic subgraph and has been widely studied. We define the concept of circular vertex arboricity of graph , which is a natural generalization of vertex arboricity. We give some basic properties of circular vertex arboricity and study the circular vertex arboricity of planar graphs. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0166218X
- Volume :
- 159
- Issue :
- 12
- Database :
- Academic Search Index
- Journal :
- Discrete Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 60920658
- Full Text :
- https://doi.org/10.1016/j.dam.2011.04.009