校 庆 学 术 报 告
（运 筹 学 讨 论 班）

报告题目: Injective Coloring of graphs
报告人: 王 维 凡 教授 （浙江师范大学数学系）

报告地点: 理科大楼A1510

时间: 10月11号（周三）下午4：30-5：30

报告内容: A coloring of a graph G is injective if its restriction to the neighborhood of any vertex is injective. The injective chromatic number ¬i(G) of a graph G is the least k such that there is an injective k-coloring. In this talk, we shall give a chief survey on this direction and study the injective coloring of planar graphs, K4-minor free graphs, etc.

欢迎大家光临！