Hits :

First Author : Chen,Min

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

Date of Publication : 2008-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.308

Issue : No.24

Page Number : 6216-6225

ISSN : 0012-365X

Translation or Not : no

Key Words : GRAPH;coloring;GRAPH;theory;MATHEMATICAL;analysis;GRAPHIC;methods;COMBINATORIAL;analysis

Abstract : A proper vertex coloring of a graph is acyclic if contains no bicolored cycle. A graph is acyclically -list colorable if for a given list assignment , there exists a proper acyclic coloring of such that for all . If is acyclically -list colorable for any