题目：Entire Coloring of Plane Graphs

报告人： Weifan Wang

（Department of Mathematics Zhejiang Normal University）

Abstract :The entire chromatic number χvef (G) of a plane graph G is the least number of colors such that any two adjacent or incident elements in V (G)∪E(G)∪F (G) receive different colors.  In this talk ,we give a survey on the entire coloring and list entire coloring of plane graphs. In particular, we show that every 2- connected simple plane graph G with maximum degree ? ≥ 20 has χvef (G) =? + 1.

时间： 2019年6月26日（周三) 16:30-17:30

地点：565net必赢客户端本部教二楼627教室

联系人：辛国策

欢迎全体师生积极参加！