Given a real number r and a graph G, a circular r-colouring of G colours vertices of G with points in a circle of circumference r so that colours assigned to adjacent vertices are at least distance 1 apart. Circular colouring of graphs is a refinement of the conventional vertex colouring of graphs. The concept has atttract a lot of attention in the past twenty years, and becomes an important branch of chromatic graph theory, with many exciting results and new techniques. This talk gives a survey on some recent results in this area.