Hits :

First Author : Chen,Yongzhu

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

Date of Publication : 2008-01-01

Document Type : 期刊

Journal : Computers and Mathematics with Applications

Volume: Vol.56

Issue : No.8

Page Number : 2073-2078

ISSN : 0898-1221

Translation or Not : no

Key Words : GRAPH;theory;MAP-coloring;problem;TOPOLOGY;ALGEBRA;GRAPH;coloring

Abstract : A graph is called -choosable if, for every list assignment with for all , there is an -coloring of such that every vertex has at most neighbors having the same color as itself. Let be a graph embeddable in a surface of nonnegative characteristic. In this