The matching extension problem in general graphs is co-NP-complete (Q1743490)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The matching extension problem in general graphs is co-NP-complete |
scientific article |
Statements
The matching extension problem in general graphs is co-NP-complete (English)
0 references
13 April 2018
0 references
complexity
0 references
perfect matching
0 references
extendability
0 references
