Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik. Why Almost All ::::k:::: -Colorable Graphs Are Easy. In Wolfgang Thomas, Pascal Weil, editors, STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings. Volume 4393 of Lecture Notes in Computer Science, pages 121-132, Springer, 2007. [doi]
Abstract is missing.