Hits :

First Author : Min Chen

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

Date of Publication : 2016-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Volume: Vol.32

Issue : No.3

Page Number : 927-940

ISSN : 1382-6905;1573-2886

Translation or Not : no

Key Words : Planar;graphs;Improper;choosability;Cycle

Abstract : A list assignment of a graph G is a function L that assigns a list L(v) of colors to each vertex \(v\in V(G)\). An \((L,d)^*\)-coloring is a mapping \(\pi \) that assigns a color \(\pi (v)\in L(v)\) to each vertex \(v\in V(G)\) so that at most d neighbors