Hits :

First Author : Min Chen

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

Date of Publication : 2017-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Volume: Vol.34

Issue : No.4

Page Number : 987-1011

ISSN : 1382-6905;1573-2886

Translation or Not : no

Key Words : Planar;graphs;Choosability;with;separation;List;coloring;Cycles

Abstract : A (k, d)-list assignment L of a graph is a function that assigns to each vertex v a list L(v) of at least k colors satisfying \(|L(x)\cap L(y)|\le d\) for each edge xy. An L-coloring is a vertex coloring \(\pi \) such that \(\pi (v) \in L(v)\) for each ve