A lower bound for testing 3-colorability in bounded-degree graphs (2002)

by A Bogdanov, K Obata, L Trevisan
Venue:In Proceedings of the Forty-Third Annual Symposium on Foundations of Computer Science (FOCS