Wenli Zhou

collaborators

2 papers

cs.DM2007

Dynamic 3-Coloring of Claw-free Graphs

Xueliang Li, Wenli Zhou

A {\it dynamic $k$ -coloring} of a graph $G$ is a proper $k$ -coloring of the vertices of $G$ such that every vertex of degree at least 2 in $G$ will be adjacent to vertices with at…

cs.DM2007

Complexity of the conditional colorability of graphs

Xueliang Li, Xiangmei Yao, Wenli Zhou

For an integer $r > 0$ , a conditional $(k, r)$ -coloring of a graph $G$ is a proper $k$ -coloring of the vertices of $G$ such that every vertex $v$ of degree $d (v)$ in $G$ is adjacent t…