Article contents
Counting Coloured Graphs II
Published online by Cambridge University Press: 20 November 2018
Extract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1964