On the complexity of finding the chromatic number of a recursive graph I: the bounded case
- 10 November 1989
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 45 (1) , 1-38
- https://doi.org/10.1016/0168-0072(89)90029-8
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- On the boolean closure of NPPublished by Springer Nature ,2005
- A cardinality version of Beigel's nonspeedup theoremThe Journal of Symbolic Logic, 1989
- Some undecidable problems involving the edge-coloring and vertex-coloring of graphsDiscrete Mathematics, 1984
- An effective version of Hall’s theoremProceedings of the American Mathematical Society, 1983
- The Effective Version of Brooks' TheoremCanadian Journal of Mathematics, 1982
- Recursive Colorings of Highly Recursive GraphsCanadian Journal of Mathematics, 1981
- An effective version of Dilworth’s theoremTransactions of the American Mathematical Society, 1981
- Recursive Colorings of GraphsCanadian Journal of Mathematics, 1980
- Recursive Euler and Hamilton pathsProceedings of the American Mathematical Society, 1976
- Effective Matchmaking and k-Chromatic GraphsProceedings of the American Mathematical Society, 1973