报告人：陈敏博士，浙江师范大学

报告时间：2017年6月10日10:00

报告地点：数计学院4号楼229室

报告题目：Choosability with separation of planar graphs

报告摘要：A $(k,d)$-list assignment $L$ of a graph $G$ is a function that assigns to each vertex $v$ a list $L(v)$ of at least $k$ colors and $|L(x)\\cap L(y)|\\le d$ for each edge $xy$. A graph $G$ is $(k,d)$-choosable if there exists an $L$-coloring of $G$ for every $(k,d)$-list assignment $L$.  This concept is known as choosability with separation.

In this talk, I firstly give a short survey on this direction.Then, I will show that planar graphs with neither 5-cycles nor chordal 6-cycles are $(3,1)$-choosable, which is a  strengthening of a result in [I. Choi, B. Lidick\\'{y}, D. Stolee, On Choosability with separation of planar graphs with forbidden cycles, J. Graph Theory, 2015] which  says that planar graphs with neither 5-cycles nor  $6$-cycles are $(3,1)$-choosable.

This is joint work with Andr\\'{e} Raspaud, Wai Chee Shiu and Weifan Wang.

欢迎老师和研究生参加！