Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Achlioptas, D., Naor, A.: The two possible values of the chromatic number of a random graph. Annals of Mathematics 162(3), 1335–1351 (2005)
2. Chung, F., Lu, L.: The diameter of sparse random graphs. Advances in Applied Mathematics 26(4), 257–279 (2001)
3. Coja-Oghlan, A., Vilenchik, D.: Chasing the k-colorability threshold. In: FOCS, pp. 380–389 (2013)
4. Dyer, M., Frieze, A.: Randomly coloring random graphs. Random Structures & Algorithms 36(3), 251–272 (2010)
5. Dyer, M.E., Flaxman, A.D., Frieze, A.M., Vigoda, E.: Randomly coloring sparse random graphs with fewer colors than the maximum degree. Random Struct. Algorithms 29(4), 450–465 (2006)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献