Searching for "A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

A lower bound for testing 3-colorability in bounded-degree graphs
by Andrej Bogdanov, Kenji Obata, Luca Trevisan — 2002 — In Proc. 43rd IEEE Symp. on Foundations of Comp. Science
…A Lower Bound for Testing 3-Colorability in Bounded-degree Graphs Andrej Bogdanov ∗ Kenji Obata…
Cited by 19 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB