This paper designs a set of graph operations and proves that starting from , by repeatedly applying these operations, one can construct all graphs with (for ). This can be viewed as an analogue of Hajós' Theorem for the circular chromatic number.