报告名称:

3-hued Coloring of K_1,3-free Graphs

报告来源：永利集团88304官网

李昊

作者简介：

所在学校：

中国人民大学

职称：

博士

其他

报告时间：

2015年1月7日（星期三）10:30– 11:30

报告地点：

永利集团88304官网201学术报告厅

报告摘要：

For positive integerskandr, an (k;r)-coloring of a graphGis a properk-coloring of the vertices such that every vertex of degreeiwill be adjacent to vertices with at least min｛i,r｝ different colors. The smallest integerkfor which a graph has an (k; r)-coloring is ther-hued chromatic numberΧr(G). It is known that there exist families ofgraphs in which the difference betweenΧr(G) and the classic chromatic number tends to infinity. It has been one of the main research stream problems to identify graph families in which In this the difference betweenΧr(G) and the classic chromatic number is bounded. We investigate the 3-hued chromatic number of claw-free graphs and give out its best possible upper bound.