Article contents
The Number of Coloured Graphs
Published online by Cambridge University Press: 20 November 2018
Extract
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:
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1963
References
- 2
- Cited by