The circular chromatic number of induced subgraphs

This note presents an infinite family of graphs G for which χc(G)=4 and for each vertex x of G, χc(G−x)=8/3. This gives a negative answer to a question asked in Zhu (Discrete Math. 229 (1–3) (2001) 371).