Hits :

First Author : Weifan Wang

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

Date of Publication : 2016-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Volume: Vol.31

Issue : No.3

Page Number : 1221-1240

ISSN : 1382-6905;1573-2886

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\in V(G)\cup E(G) \cup F(G)\), there exists a coloring which assigns to each vertex, each edge and each face a color from its list so that