  A uniquely $k$-colourable graph is a graph with exactly one partition of the
vertex set into at most $k$ colour classes. Here, we investigate some
constructions of uniquely $k$-colourable graphs and give a construction of
$K_k$-free uniquely $k$-colourable graphs with equal colour class sizes.
