Abstract.
This paper designs a set of graph operations, and proves that for 2≤k/d<3, starting from K k / d , by repeatedly applying these operations, one can construct all graphs G with χ c (G)≥k/d. Together with the result proved in [20], where a set of graph operations were designed to construct graphs G with χ c (G)≥k/d for k/d≥3, we have a complete analogue of Hajós' Theorem for the circular chromatic number.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partially supported by the National Science Council under grant NSC 89-2115-M-110-003
Rights and permissions
About this article
Cite this article
Zhu, X. An Analogue of Hajós' Theorem for the Circular Chromatic Number (II). Graphs and Combinatorics 19, 419–432 (2003). https://doi.org/10.1007/s00373-002-0505-9
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00373-002-0505-9