题目：On two coloring problems
报告人：陆 玫 教授（清华大学）
摘要：Let G=(V, E) be a graph. A d-distance (resp. exactly d-distance) coloring of V is to color the vertices of V such that any two vertices with distance at most d (resp. exactly d) have different colors. Denote (resp. ) as the minimum number of colors needed for a d-distance (resp. an exactly d-distance) coloring of V. In this talk, some upper and lower bounds on and when G is a q-ary n-cube or a matrix graph are given respectively.