Author:
Achlioptas Dimitris,Moore Cristopher
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Achlioptas, D., Moore, C.: Almost all graphs of degree 4 are 3-colorable. Journal of Computer and System Sciences 67(4), 441–471 (2003)
2. Achlioptas, D., Moore, C.: The asymptotic order of the k-SAT threshold. In: Proc. 43rd Foundations of Computer Science, pp. 779–788 (2002)
3. Lecture Notes in Computer Science;D. Achlioptas,2002
4. Achlioptas, D., Naor, A.: The two possible values of the chromatic number of a random graph. In: Proc. 36th Symp. on the Theory of Computing (2004)
5. Bollobás, B.: Random graphs. Academic Press, London (1985)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Chromatic Number of Random Regular Hypergraphs;SIAM Journal on Discrete Mathematics;2024-04-24
2. Lower Bounds on the Chromatic Number of Random Graphs;Combinatorica;2021-10-26
3. Planting Colourings Silently;Combinatorics, Probability and Computing;2016-12-07
4. The Chromatic Number of Random Graphs for Most Average Degrees;International Mathematics Research Notices;2015-11-19
5. Tight Bounds on the Threshold for Permuted k-Colorability;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2012