学术报告

Edge Coloring of Embedding Graphs

阅读次数:989

题目: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.

欢迎各位参加!
 

联系我们

    电话:86-21-65981384

    地址:上海市四平路1239号 致远楼

Copyright © 2018  同济大学数学科学学院 版权所有.