graph whose vertex set is � and in which two vertices are adjacent if and only if their distance in � is at most �. A vertex coloring of � is acyclic if each bichromatic subgraph is a forest. A star coloring of � is an acyclic coloring in which each bichromatic subgraph is a star forest.