Planar graphs: Random walks and bipartiteness testing

Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler

Abstract: We initiates the study of property testing in arbitrary planar graphs. We prove that bipartiteness can be tested in constant time, improving on the previous bound of for graphs on n vertices. The co...