An analogue of Hajos' Theorem for the circular chromatic number (II)

This paper designs a set of graph operations, and proves that for 2 less than or equal to 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 Hajos' Theorem for the circular chromatic number.