On the complexity of finding the chromatic number of a recursive graph II: the unbounded case
- 20 December 1989
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 45 (3) , 227-246
- https://doi.org/10.1016/0168-0072(89)90037-7
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Unbounded Searching AlgorithmsSIAM Journal on Computing, 1990
- On the complexity of finding the chromatic number of a recursive graph I: the bounded caseAnnals of Pure and Applied Logic, 1989
- Recursive coloration of countable graphsAnnals of Pure and Applied Logic, 1983
- Searching, Merging, and Sorting in Parallel ComputationIEEE Transactions on Computers, 1983
- Recursive Colorings of GraphsCanadian Journal of Mathematics, 1980
- An almost optimal algorithm for unbounded searchingInformation Processing Letters, 1976
- Effective colorationThe Journal of Symbolic Logic, 1976