Hits :

First Author : WANG

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

Date of Publication : 2014-01-01

Document Type : 期刊

Journal : 中国科学(数学)(英文版)

Issue : 第1期

Page Number : 197-209

ISSN : 1674-7283

Translation or Not : no

Key Words : acyclic；coloring；acyclic；choosability；planar；graph

Abstract : A proper vertex coloring of a graph G is acyclic if G contains no bicolored cycles.Given a list assignment L={L(v)|v∈V}of G,we say that G is acyclically L-colorable if there exists a proper acyclic coloringπof G such thatπ(v)∈L(v)for all v∈V.If G is acycl