The circular chromatic number of induced subgraphs
The circular chromatic number of induced subgraphs
复制标题
DOI：
10.1016/j.jctb.2004.03.007
复制
发表时间：
2004-09
期刊：
影响因子：
--
通讯作者：
Xuding Zhu
中科院分区：
文献类型：
--
作者：
Xuding Zhu
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).
