题 目：On two coloring problems

报告人：陆玫 教授 (清华大学)

Abstract:Let G = (V, E) be a simple undirected graph with the vertex set V and the edge set E.An d-distance (resp. exactly d-distance) coloring of V (G) is to color the vertices of V (G) such that any two vertices with distance at most d (resp. exactly d) have different colors. In this talk, we will give some results on these two problems.

时间： 1月11日(周五)16:00-17:00

地点：565net必赢客户端本部教二楼 513 教室

联系人：张俊

欢迎全体师生积极参加！