报告题目：On DP-degree-coloring outerplanar graphs

报告简介：In this lecture, we will introduce the DP-coloring which is the generalization of a list coloring. In 2008, Hutchinson showed that if a 2-connected bipartite outerplanar graph G with a list of colors L(v) for each vertex v such that |L(v)| ≥ min{d(v), 4}, then G is L-colorable and if a maximal outerplanar graph G with at least four vertices having a list of colors L(v) for each vertex v such that |L(v)| ≥ min{d(v), 5}, then G is L-colorable. We want to know whether the bounds of Hutchinson’s results hold for DP-coloring or not. In this talk, we give the first one is a negative answer and the second one is a positive answer.

报告人：代天骄，巴黎十一大，研究方向为图论及其应用，主要研究方向为图的染色，图的哈密尔顿圈，极值图论等。相关论文多发表在Discrete Math. 等国际期刊。

报告时间：2021年5月13日（星期四）下午 2:00-5:00.

报告地点：腾讯会议，ID： 832 786 786

主办单位：扬州大学数学科学学院

欢迎广大师生参加！