Author:
Beame Paul,Culberson Joseph,Mitchell David,Moore Cristopher
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference37 articles.
1. A sharp threshold for k-colorability;Achlioptas;Random Structures Algorithms,1999
2. The analysis of a list-coloring algorithm on a random graph;Achlioptas,1997
3. Almost all graphs with 2.522n edges are not 3-colorable;Achlioptas;Electron. J. Combin.,1999
4. Almost all graphs with average degree 4 are 3-colorable;Achlioptas,2002
5. D. Achlioptas, A. Naor, The two possible values of the chromatic number of a random graph, in: Proceedings of the Thirty-Sixth Annual Symposium on Theory of Computing, Chicago, IL, June 2004, pp. 587–593.
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds;Journal of the ACM;2024-07-04
2. Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Chapter 7. Proof Complexity and SAT Solving;Frontiers in Artificial Intelligence and Applications;2021-02-02
4. Bibliography;Proof Complexity;2019-03-28
5. The Nature of Proof Complexity;Proof Complexity;2019-03-28