Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T18:05:50.159Z Has data issue: false hasContentIssue false

Graph-Colouring and Combinatorial Numbers

Published online by Cambridge University Press:  20 November 2018

Andrew Sobczyk*
Affiliation:
Clemson University, Clemson, S.C.
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.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1968