王维凡
professor
Gender : Male
Alma Mater : 南京大学
Education Level : Graduate student graduate
Degree : Doctorate
Status : 退休
School/Department : 数学科学学院
Date of Employment : 2002-05-01
Hits :
First Author : Min Chen
Affiliation of Author(s): 数理与信息工程学院
Date of Publication : 2018-01-01
Document Type : 期刊
Journal : Bulletin of the Malaysian Mathematical Sciences Society
Volume: Vol.41
Issue : No.3
Page Number : 1507-1518
ISSN : 0126-6705;2180-4206
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