Academy of Mathematics and Systems Science, CAS Colloquia & Seminars
Speaker:
Weifan Wang,Department of Mathematics, Zhejiang Normal University
Inviter:
闫桂英
Title:
Entire Coloring of Plane Graphs
Time & Venue:
2019.7.12 11:00-12:00 Z305
Abstract:
The entire chromatic number cvef(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 Δ3 20 has cvef(G) =Δ+1.