题目：Edge Coloring of Embedding Graphs

报告人：罗荣 教授 （美国西弗吉尼亚大学）

时间🤟🏻：12月20日 周四下午 3:30-4:30

地点：致远楼 101室

Abstract：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.

欢迎各位参加！