Abstract
A uniquelyk-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 Kk-free uniquely k-colourable graphs with equal colour class sizes.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
