|
|
|
|
THE L(2; 1)-CHOOSABILITY OF CYCLE
|
|
|
|
|
|
|
|
نویسنده
|
شیو وای چی ,ژو هایینگ ,چی بور لام پیتر
|
|
منبع
|
transactions on combinatorics - 2012 - دوره : 1 - شماره : 3 - صفحه:21 -38
|
|
چکیده
|
Abstract. for a given graph g = (v;e), let l(g) = fl(v) : v 2 v g be a prescribed list assignment.g is l-l(2; 1)-colorable if there exists a vertex labeling f of g such that f(v) 2 l(v) for all v 2 v ;jf(u) ?? f(v)j 2 if dg(u; v) = 1; and jf(u) ?? f(v)j 1 if dg(u; v) = 2. if g is l-l(2; 1)-colorable forevery list assignment l with jl(v)j k for all v 2 v , then g is said to be k-l(2; 1)-choosable. in thispaper, we prove all cycles are 5-l(2; 1)-choosable.
|
|
کلیدواژه
|
L(2; 1)-labeling ,Choosability ,cycle ,path
|
|
آدرس
|
Hong Kong Baptist University, China, Hong Kong Baptist University, China, BNU-HKBU United International College, China
|
|
پست الکترونیکی
|
cblam@uic.edu.hk
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|