Hits :

First Author : Weifan Wang

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

Date of Publication : 2008-01-01

Document Type : 期刊

Journal : Journal of Graph Theory

Volume: Vol.58

Issue : No.1

Page Number : 27-44

ISSN : 0364-9024

Translation or Not : no

Key Words : plane;graph;•list;coupled;coloring;•list;entire;coloring

Abstract : A plane graph G is coupled k-choosable if, for any list assignment L satisfying for every , there is a coloring that assigns to each vertex and each face a color from its list such that any two adjacent or incident elements receive distinct colors. We pro