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.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.