题  目：On r-hued colorings of graphs

报告人：Professor Hongjian Lai, West Virginia University

时   间：2013年12月12日    下午4:30--5:30

地   点：东区管理科研楼 365英国上市官网1611会议室

摘   要：

An $r$-hued $k$-coloring of a graph $G$ is a proper vertex $k$-coloring of $G$ such that for every vertex $v /in V(G)$, the neighbors of $v$ in $G$ will receive at least $/min/{r, d_G(v)/}$ colors. We will introduce the origin and development of the problem and discuss some of the problems of interests.

主办单位：       365英国上市官网 
                中科院吴文俊数学重点实验室

 
欢迎广大师生参加！