Graph-Colouring and Combinatorial Numbers
- 1 January 1968
- journal article
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 20, 520-534
- https://doi.org/10.4153/cjm-1968-054-x
Abstract
We shall use the termn-configurationfor the complete graph havingnvertices, which we visualize as a regular convex polygon. The sides and diagonals will be referred to asedges. A complete sub-configuration ofpvertices (subset ofpvertices with all interconnecting edges) will be called ap-tuple. A 3-tuple will be called a triple or triangle, a 4-tuple a quadruple, etc.Keywords
This publication has 0 references indexed in Scilit: