@article{M19uniquelycolourable, title = {On uniquely colourable graphs}, author = {Mohr, Samuel}, % journal = {}, % number = {3}, pages = {103--105}, % volume = {88}, year = {2019}, url = {http://wwwhome.math.utwente.nl/~ctw/CTW2019ProceedingsFinal.pdf}, biburl = {http://samuel-mohr.de/files/bib/extabstr1.bib}, note = {Cologne-Twente Workshop 2019}, 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. } }