Geodesic
Recursive Colorings of Graphs
Canadian journal of mathematics, Tome 32 (1980) no. 4, pp. 821-830

Voir la notice de l'article provenant de la source Cambridge University Press

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. 
Schmerl, James H. Recursive Colorings of Graphs. Canadian journal of mathematics, Tome 32 (1980) no. 4, pp. 821-830. doi: 10.4153/CJM-1980-062-7
@article{10_4153_CJM_1980_062_7,
     author = {Schmerl, James H.},
     title = {Recursive {Colorings} of {Graphs}},
     journal = {Canadian journal of mathematics},
     pages = {821--830},
     year = {1980},
     volume = {32},
     number = {4},
     doi = {10.4153/CJM-1980-062-7},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1980-062-7/}
}
TY  - JOUR
AU  - Schmerl, James H.
TI  - Recursive Colorings of Graphs
JO  - Canadian journal of mathematics
PY  - 1980
SP  - 821
EP  - 830
VL  - 32
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1980-062-7/
DO  - 10.4153/CJM-1980-062-7
ID  - 10_4153_CJM_1980_062_7
ER  - 
%0 Journal Article
%A Schmerl, James H.
%T Recursive Colorings of Graphs
%J Canadian journal of mathematics
%D 1980
%P 821-830
%V 32
%N 4
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1980-062-7/
%R 10.4153/CJM-1980-062-7
%F 10_4153_CJM_1980_062_7

[1] 1. Bean, D. R., Effective coloration, J. Symbolic Logic 41 (1976), 469–480. Google Scholar

[2] 2. Jockusch, C. G. Jr., Π 0 classes and Boolean combinations of recursively enumerable sets, J. Symbolic Logic 30 (1974), 95–96. Google Scholar

[3] 3. Manaster, A. and Rosenstein, J., Effective matchmaking and k-chromatic graphs, Proc. Amer. Math. Soc. 39 (1973), 371–378. Google Scholar

[4] 4. Schmerl, J. H., The effective version of Brooks’ theorem (in preparation). Google Scholar | DOI

[5] 5. Specker, E., Eine Verschdrfung des Unvollständigkeitssatzes der Zahlentheorie, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 5 (1957). Google Scholar

Cité par Sources :