报告主题：图的完全染色（Entire Coloring of Graphs）
报 告 人：王艺桥 教授（北京中医药大学）
报告时间：2021年5月14日（周五） 19:30-20:30
会议形式：腾讯会议
会议ID：906530212
邀请人：袁西英
主办部门：理学院数学系
报告摘要：A graph G = (V,E,F) is entirely k-colorable if V ∪ E ∪ F can be colored with k colors such that any two adjacent or incident elements receive different colors. In this talk, we give a brief survey on the research progress about the entire coloring of graphs and prove that every 2-connected simple planar graph G with ? ≥ 20 has χvef (G) = ? + 1.