报告人：Min Chen 浙江师范大学

报告时间：6月22日  11:00-12:00

地点：1518

 

摘要:

An (L, d)∗-coloring is a mapping π that assigns a color π(v) ∈ L(v) to eachvertex v ∈ V (G) so that at most d neighbors of v receive color π(v). A graphG is said to be (k, d)∗-choosable if it admits an (L, d)∗-coloring for every listassignment L with |L(v)| ≥ k for all v ∈ V (G).In this talk, firstly, I will show some known results on improper list coloringof (planar) graphs with some restrictions. Then, I will give a short proof of ourrecent result which says that every planar graph without adjacent triangles and6-cycles is (3, 1)∗-choosable. This partially answers the question proposed byXu and Zhang that every planar graphs without adjacent triangles is (3, 1)∗-choosable.This is joint work with Andr′e Raspaud and Weifan Wang.Keyword: Planar graphs; Improper choosability; Cycle