, Volume 16, Issue 2, pp 259-268

On the recognition complexity of some graph properties

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

By applying a topological approach due to Kahn, Saks and Sturtevant, we prove that all decreasing graph properties consisting of bipartite graphs only are elusive. This is an analogue to a well-known result of Yao.