Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-15T03:37:18.287Z Has data issue: false hasContentIssue false
  • English
  • Français

Counting Coloured Graphs II

Published online by Cambridge University Press:  20 November 2018

E. M. Wright
E. M. Wright*
Affiliation:
University of Aberdeen, Aberdeen, Scotland
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.

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
Canadian Journal of Mathematics , Volume 16 , 1964 , pp. 128 - 135
Copyright
Copyright © Canadian Mathematical Society 1964

References

1. Bellman, R., A brief introduction to Theta-functions (New York, 1961), p. 70.Google Scholar
2. Wright, E. M., Counting coloured graphs, Can. J. Math., 13 (1961), 683–693.Google Scholar