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.
Publisher
Cambridge University Press (CUP)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献