Hits :

First Author : Huang, Danjun

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

Date of Publication : 2013-01-01

Document Type : 期刊

Journal : International Journal of Computer Mathematics

Volume: Vol.90

Issue : No.2

Page Number : 258-272

ISSN : 0020-7160

Translation or Not : no

Key Words : vertex;arboricity;planar;graph;cycle;chord;colouring;05C15

Abstract : The vertex arboricity va(G) of a graph G is the minimum number of colours the vertices can be coloured so that each colour class induces a forest. It was known that va(G)≤3 for every planar graph G, and the problem of computing vertex arboricity of graphs