Hits :

First Author : Danjun Huang

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

Date of Publication : 2012-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.312

Issue : No.15

Page Number : 2304-2315

ISSN : 0012-365X

Translation or Not : no

Key Words : Vertex;arboricity;Planar;graph;Cycle

Abstract : The vertex arboricity va(G) of a graph G is the minimum number of colors the vertices can be labeled so that each color class induces a forest. It was well-known that va(G)≤3 for every planar graph G. In this paper, we prove that va(G)≤2 if G is a planar