学术报告第201638期
报告题目:On choosability with separation of planar graphs
报告人:陈敏博士(浙江师范大学)
报告时间:2016年10月16日下午4:00
报告地点:南一楼中311室
Abstract:A (k, d)-list assignment L of a graph G is a function that assigns to eachvertex v a list L(v) of at least k colors and |L(x)⋂L(y)|≤df......