Hits :

First Author : Min Chen

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2012-01-01

Document Type : 期刊

Journal : European Journal of Combinatorics

Volume: Vol.33

Issue : No.5

Page Number : 905-923

ISSN : 0195-6698

Translation or Not : no

Abstract : The vertex-arboricity a ( G ) of a graph G is the minimum number of subsets into which vertex set V ( G ) can be partitioned so that each subset induces an acyclic graph. In this paper, we prove one of the conjectures proposed by Raspaud and Wang (2008) [