A Construction of Uniquely Colourable Graphs with Equal Colour Class Sizes
Abstract
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.
 Publication:

arXiv eprints
 Pub Date:
 January 2020
 arXiv:
 arXiv:2001.08801
 Bibcode:
 2020arXiv200108801M
 Keywords:

 Mathematics  Combinatorics;
 05C15;
 G.2.2
 EPrint:
 doi:10.1016/j.dam.2020.11.015