Hits :

First Author : Weifan Wang

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

Date of Publication : 2009-01-01

Document Type : 期刊

Journal : Journal of Graph Theory

Volume: Vol.61

Issue : No.4

Page Number : 307-323

ISSN : 0364-9024

Translation or Not : no

Key Words : acyclic;coloring;choosability;planar;graph;cycle

Abstract : A proper vertex coloring of a graph G=(V, E) is acyclic if G contains no bicolored cycle. A graph G is acyclically L-list colorable if for a given list assignment L={L(v)|vV}, there exists a proper acyclic coloring of G such that (v)L(v) for all vV. If G