Abstract
AbstractWe denote the complete graph on n vertices by Kn. A proper k–colouring of Kn is a way of assigning colours from a set of k colours to the edges of Kn in such a way that no monochromatic triangles are formed. It is known that there are precisely two proper 3-colourings of K16 each of which has exactly one proper 3-colouring of K15 embedded in it. We show that these two are the only proper 3-colourings of K15.
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
