Online ordering is currently unavailable due to technical issues. We apologise for any delays responding to customers while we resolve this. For further updates please visit our website: https://www.cambridge.org/news-and-insights/technical-incident Due to planned maintenance there will be periods of time where the website may be unavailable. We apologise for any inconvenience.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Published online by Cambridge University Press: 20 November 2018
As in my earlier paper (2), a graph on n labelled nodes is a set of n objects called "nodes" distinguishable from each other and a set (possibly empty) of "edges," i.e. pairs of distinct nodes. Each edge is said to join its pair of nodes and no edge joins a node to itself. By a k-colouring of the nodes of such a graph we mean a mapping of the nodes onto a set of k distinct colours, such that no two nodes joined by an edge are mapped onto the same colour. By a colouring of the edges of such a graph we mean a mapping of the edges onto a set of colours.
