On the NP-completeness of the perfect matching free subgraph problem

Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin, Christophe Picouleau. On the NP-completeness of the perfect matching free subgraph problem. Theoretical Computer Science, 423:25-29, 2012. [doi]

Abstract

Abstract is missing.