Title：On DP-degree-coloring outerplanar graphs

Abstract：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.

Speaker：Tianjiao Dai，University Paris-Sud，mainly works on graph coloring, extremal graph theory and Hamiltonian cycles. Her results aremainly published on Discrete Mathematics etc..

Date：2:00pm-5:00pm 2021-5-13日（Thursday）.

Tencent Meeting ID： 832 786 786

Organizer：School of Mathematical Science

Students and teachers who are interested in graph theory are welcome.