Hits :

First Author : Xiaoxue Hu

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

Date of Publication : 2014-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.327

Page Number : 1-8

ISSN : 0012-365X

Translation or Not : no

Key Words : Plane;graph;Coloring;Edge-face;choosability;Maximum;degree

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