Graph colorings and recursively bounded Π10-classes
- 31 December 1986
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 32, 185-194
- https://doi.org/10.1016/0168-0072(86)90051-5
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Recursive Colorings of Highly Recursive GraphsCanadian Journal of Mathematics, 1981
- On the Effectiveness of the Schroder-Bernstein TheoremProceedings of the American Mathematical Society, 1981
- An effective version of Dilworth’s theoremTransactions of the American Mathematical Society, 1981
- Recursive Colorings of GraphsCanadian Journal of Mathematics, 1980
- Effective colorationThe Journal of Symbolic Logic, 1976
- Recursive Euler and Hamilton PathsProceedings of the American Mathematical Society, 1976
- Effective Matchmaking and k-Chromatic GraphsProceedings of the American Mathematical Society, 1973
- Degrees of members of Π10classesPacific Journal of Mathematics, 1972
- Countable retracing functions and Π20predicatesPacific Journal of Mathematics, 1969
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950