Hostname: page-component-8448b6f56d-cfpbc Total loading time: 0 Render date: 2024-04-19T19:37:36.622Z Has data issue: false hasContentIssue false
  • English
  • Français

Recursive Colorings of Graphs

Published online by Cambridge University Press:  20 November 2018

James H. Schmerl
James H. Schmerl*
Affiliation:
The University of Connecticut, Storrs, Connecticut
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.

A graph G is an ordered pair G = (V, E) where E is a set of 2-element subsets of V. The set V is the set of vertices, and E is the set of edges. The vertices x and y are joined by an edge if {x, y} is an edge. If X is a set (of colors) and χ : V →X, then we say that χ is an X-coloring of G if whenever two vertices x and y are joined by an edge, then χ(x) ≠ x(y). A graph is X-colorable if there is an χ-coloring of it. We will identify the natural number n with the set {0, 1, …, n – 1}, and often refer to n-colorings and to graphs being n-colorable.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 32 , Issue 4 , April 1980 , pp. 821 - 830
Copyright
Copyright © Canadian Mathematical Society 1980

References

1. Bean, D. R., Effective coloration, J. Symbolic Logic 41 (1976), 469–480.Google Scholar
2. Jockusch, C. G. Jr., Π1 0 classes and Boolean combinations of recursively enumerable sets, J. Symbolic Logic 30 (1974), 95–96.Google Scholar
3. Manaster, A. and Rosenstein, J., Effective matchmaking and k-chromatic graphs, Proc. Amer. Math. Soc. 39 (1973), 371–378.Google Scholar
4. Schmerl, J. H., The effective version of Brooks’ theorem (in preparation).CrossRefGoogle Scholar
5. Specker, E., Eine Verschdrfung des Unvollständigkeitssatzes der Zahlentheorie, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 5 (1957).Google Scholar