报告题目:Coloring of planar graphs with few colors
报告摘要:It’s well-known that every planar graph is 4-colorable, and when it also does not contain triangles, then it is 3-colorable. It is NP-hard to decide if a planar graph is 3-colorable. There are many old and new problems on the coloring of planar graphs.
In this talk, we will present some recent results on some famous conjectures in the field, and talk about some of the related problems in terms of relaxed colorings.
报告时间:2016年6月28日(周二)上午10:00-11:00
报告地点:教学二楼2126
欢迎老师和同学参加!
报告人简介:喻革新博士2006年毕业于美国伊利诺伊大学厄本那-香槟分校(University of Illinois at Urbana-Champaign), 2006-2008年在美国范德堡大学(Vanderbilt University)作博士后。现为美国威廉与玛丽学院(College of William and Mary)数学系副教授,华中师范大学“楚天学者讲座教授”,美国数学会会员。 喻博士主要研究方向是图论与组合,他多次获得美国国家科学基金会、美国国家安全局的项目资助,已在J. Comb. Theory Ser. B, J. Graph Theory, Discrete Math., European J. of Combinatorics, SIAM J. Discrete Math.等图论方向国际权威学术期刊上发表论文40余篇。
发布时间:2016-06-17 点击量:268