Hits :

First Author : Xiaoxue Hu

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

Date of Publication : 2016-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.339

Issue : No.11

Page Number : 2742-2753

ISSN : 0012-365X

Translation or Not : no

Key Words : Plane;graph;Entire;choosability;Maximum;degree

Abstract : A plane graph G is entirely k -choosable if, for every list L of colors satisfying L(x)=k for all x∈V(G)∪E(G)∪F(G) , there exists a coloring which assigns to each vertex, each edge and each face a color from its list so that any adjacent or incident eleme