Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-22T14:43:38.020Z Has data issue: false hasContentIssue false
  • English
  • Français

Coloured Graphs: A Correction and Extension

Published online by Cambridge University Press:  20 November 2018

R. C. Read  and
E. M. Wright
R. C. Read
Affiliation:
Computing Centre, University of the West Indies, Kingston, Jamaica
E. M. Wright
Affiliation:
University of Aberdeen, Aberdeen, Scotland
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Correction
Information
Canadian Journal of Mathematics , Volume 22 , Issue 3 , 01 June 1970 , pp. 594 - 596
Copyright
Copyright © Canadian Mathematical Society 1970

References

1. E. N., Gilbert, Enumeration of labelled graphs, Can. J. Math. 8 (1956), 405–411.Google Scholar
2. Hardy, G. H. and Wright, E. M., Introduction to the theory of numbers, 4th ed. (Ox Univ. Press, Oxford, 1960).Google Scholar
3. Read, R. C., The number of k-coloured graphs on labelled nodes, Can. J. Math. 12 (1960), 410–414.Google Scholar
4. Wright, E. M., Counting coloured graphs, Can. J. Math. 13 (1961), 683–693.Google Scholar
5. Wright, E. M., Counting coloured graphs. II, Can. J. Math. 16 (1964), 128–135.Google Scholar