On the NP-completeness of the perfect matching free subgraph problem (Q418003)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the NP-completeness of the perfect matching free subgraph problem |
scientific article |
Statements
On the NP-completeness of the perfect matching free subgraph problem (English)
0 references
14 May 2012
0 references
bipartite graph
0 references
matching
0 references
blocker
0 references
stable set
0 references
tripartite graph
0 references
NP-complete
0 references
structural analysis problem
0 references
