Location of Repository

Suppose G is a graph of bounded degree d, and one needs to remove ɛn of its edges in order to make it planar. We show that in this case the statistics of local neighborhoods around vertices of G is far from the statistics of local neighborhoods around vertices of any planar graph G ′. In fact, a similar result is proved for any minor-closed property of bounded degree graphs. As an immediate corollary of the above result we infer that many well studied graph properties, like being planar, outer-planar, series-parallel, bounded genus, bounded tree-width and several others, are testable with a constant number of queries. None of these properties was previously known to be testable even with o(n) queries.

Year: 2007

OAI identifier:
oai:CiteSeerX.psu:10.1.1.135.9632

Provided by:
CiteSeerX

Download PDF:To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.