题  目：On r-hued colorings in graphs under forbidden subgraph conditions

内容简介：$r$-hued colorings of graphs are natural generalizations of classic graph colorings. It is known that the difference between $r$-hued chromatic number $chi_r(G)$ and the classic chromatic number $chi(G)$ can be arbitrarily large. Therefore, it is of interests to find graph families in which the $r$-hued chromatic number $chi_r(G)$ is bounded above by a function of $r$ and $chi(G)$ plus some of the characteristics of the graph family. In this talk, we will present results of this type when the graph families are graphs without induced $K_{1,3}$, without induced paths on 4 or 5 vertices.

报告人：美国西弗吉尼亚大学（West Virginia University） Hong-Jian Lai 教授

报告人简介：美国西弗吉尼亚大学数学系教授，副系主任。主要研究领域为图论。曾任Discrete Mathematics杂志客座编委，现任Graph and Combinatorics以及Journal of Discrete Mathematics等杂志编委。已出版专著三部，发表学术论文180余篇。

时  间：2017年5月23日（周二）上午10：30始

地  点：南海楼224室

热烈欢迎广大师生参加!

信息科学技术学院/网络空间安全学院

2017年5月17日