摘要: The Four Color Theorem (4CT) states that every planar graph is 4-colorable. We will mention results and problems related to 4CT, and discuss several problems that attempts to generalize 4CT. 报告人:郁星星教授, Georgia Institute of Technology时间地点: 5月22日 10:30-11:30 研楼 307
上一篇:陆林渊-The maximum p-Spectral Radius of Hypergraphs with m Edges
下一篇:周展-Homoclinic solutions of discrete nonlinear systems
必赢76net线路(中国)唯一官方网站-Official Mobile Platform版权所有©2017年 通讯地址:湖南省长沙市岳麓区麓山南路麓山门 邮编:410082 Email:xiaoban@hnu.edu.cn域名备案信息:[www.hnu.edu.cn,www.hnu.cn/湘ICP备] [hnu.cn 湘教QS3-200503-000481 hnu.edu.cn 湘教QS4-201312-010059]