Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. 3-coloring in time O(1.3289n);Beigel;Journal of Algorithms,2005
2. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs;Bollobás;European Journal of Combinatorics,1980
3. Exact and approximative algorithms for coloring G(n,p);Coja-Oghlan;Random Structures and Algorithms,2004
4. On the evolution of random graphs;Erdős;Magyar Tudományos Akadémia Matematikai Kutató Intézetének Közleményei,1960
5. Zero knowledge and the chromatic number;Feige;Journal of Computer and System Sciences,1998
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献