报告地点：行健楼学术活动室665
邀请人：许宝刚教授
报告摘要： An acyclic vertex (or edge) coloring of a graph $G$ is a proper
vertex (or edge) coloring such that no bichromatic cycles are
produced. The acyclic chromatic number (or index) of $G$ is defined
as the smallest integer $k$ such that $G$ has an acyclic vertex (or
edge) coloring using $k$ colors. In this talk we give a survey
on the research progress for the acyclic vertex coloring and the acyclic edge coloring of
graphs. In particular, we study the acyclic chromatic number (or index)
of some special graphs such as 4-regular graphs, planar graphs, 1-planar graphs, $K_4$-minor free graphs, etc.