Title： On list improper DP-coloring of planar graphs

Abstract：DP-coloring(also known as correspondence coloring)is a generalization of list coloring. Pongpat and Kittikorn introduce a DP-(k,d)*-coloring

which is a generalization of (k,d)*-coloring. In this talk, we show the

following results: (1) Every planar graph G without {4, 7}-cycles is DP-(3,1)*-colorable; (2) Every planar graph G without {4, 8}-cycles is DP-(3,1)*-colorable.

Speaker：Hongyan Cai, Guizhou University. Her research interests include  graph theory. Many of her results are published on

《Discrete Applied Mathematics》、《Bulletin of the Malaysian Mathematical Sciences Society》and so on.

Date：9:00am-10:00am 2021-12-04（Saturday）.

Tencent Meeting ID： 555 731 600

Organizer：School of Mathematical Science

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