@article{M21constructionuniquelycolourable,
	title = {A construction of uniquely colourable graphs with equal colour class sizes},
	journal = {Discrete Applied Mathematics},
	volume = {303},
	pages = {122-126},
	year = {2021},
	author = {Mohr, Samuel},
	archivePrefix = {arXiv},
	eprint = {2001.08801},
	doi = {10.1016/j.dam.2020.11.015},
	biburl = {http://samuel-mohr.de/files/bib/11.bib},
	abstract = {A uniquely {$k$}-colourable graph is a graph with exactly one partition of the vertex set into {$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. }
}