Why Almost All ::::k:::: -Colorable Graphs Are Easy - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Amin Coja-Oghlan' in GoogleThis author has not been identified. Look up 'Michael Krivelevich' in GoogleThis author has not been identified. Look up 'Dan Vilenchik' in Google

runs on WebDSL