Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-17T23:35:32.167Z Has data issue: false hasContentIssue false

The Number of Coloured Graphs

Published online by Cambridge University Press:  20 November 2018

L. Carlitz*
Affiliation:
Duke University
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.

Let Fn (k) denote the total number of k-coloured graphs on n labelled nodes and let Mn (k) denote the number of graphs on n nodes that are coloured in at most kcolours ; also let fn (k) denote the number of connected k coloured graphs on n nodes. Read (3) has proved the following formulas:

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1963