Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-20T00:37:43.732Z Has data issue: false hasContentIssue false
  • English
  • Français

Counting Coloured Graphs

Published online by Cambridge University Press:  20 November 2018

E. M. Wright
E. M. Wright*
Affiliation:
University of Aberdeen
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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,” that is, pairs of nodes. Each edge is said to join its pair of nodes, at most one edge joins any two nodes and no edge joins a node to itself. By a k-colouring of such a graph we mean a mapping of the nodes of the graph onto a set of k distinct colours, such that no two nodes joined by an edge are mapped onto the same colour. We take k > 1.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 13 , 1961 , pp. 683 - 693
Copyright
Copyright © Canadian Mathematical Society 1961

References

1. Read, R. C., The number of k-coloured graphs on labelled nodes, Can. J. Math., 12 (1960), 410–414.Google Scholar
2. Titchmarsh, E. C., Fourier Integrals (Oxford, 1937) 64.Google Scholar