报告题目：Edge coloring of embedding graphs

报 告 人：Rong Luo, 美国West Virginia University 教授

报告时间：2018年12月13日 15：30

报告地点：数统院307学术报告厅

报告摘要：

Vizing's planar graph conjecture says that every class two planar has maximum degree at most 5. The conjecture is still open. We consider the problem for graphs embeddable on a surface Sigma and attempt to find the best possible upper bound for the maximum degree of class two graphs embeddable on Sigma. In this talk I will give a survey on this topic and present some new results.