Switch to: References

Add citations

You must login to add citations.
  1. On the complexity of finding the chromatic number of a recursive graph I: the bounded case.Richard Beigel & William I. Gasarch - 1989 - Annals of Pure and Applied Logic 45 (1):1-38.
    Download  
     
    Export citation  
     
    Bookmark   6 citations