图论组合与网络研究中心
学术报告


浏览次数:

 
Speaker:

Weifan Wang,Department of Mathematics,Zhejiang Normal University

Inviter: 闫桂英 研究员
Title:
Entire Coloring of Plane Graphs
Time & Venue:

2019.7.12 11:00 Z305

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.

Affiliation:  

学术报告中国科学院数学与系统科学研究院应用数学研究所
地址 北京市海淀区中关村东路55号 思源楼6-7层 南楼5-6、8层 100190
?2000-2013 京ICP备05058656号