Circular vertex arboricity |
| |
| Authors: | Guanghui Wang Jianliang Wu |
| |
| Affiliation: | a School of Mathematics, Shandong University, Jinan, Shandong 250100, Chinab School of Mathematics and Statistics, Lanzhou University, Lanzhou 730000, China |
| |
| Abstract: | The vertex arboricity va(G) of graph G is defined as the minimum of subsets in a partition of the vertex set of G so that each subset induces an acyclic subgraph and has been widely studied. We define the concept of circular vertex arboricity vac(G) of graph G, 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. |
| |
| Keywords: | Vertex arboricity Circular vertex arboricity Partitions |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
