Article contents
Graph-Colouring and Combinatorial Numbers
Published online by Cambridge University Press: 20 November 2018
Extract
We shall use the term n-configuration for the complete graph having n vertices, which we visualize as a regular convex polygon. The sides and diagonals will be referred to as edges. A complete sub-configuration of p vertices (subset of p vertices with all interconnecting edges) will be called a p-tuple. A 3-tuple will be called a triple or triangle, a 4-tuple a quadruple, etc.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1968
Footnotes
This research was partially sponsored by National Science Foundation Grant GP-3909.
References
- 2
- Cited by