A construction of uniquely colourable graphs with equal colour class sizes

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