The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (Q5387763)
From MaRDI portal
scientific article; zbMATH DE number 5279456
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number |
scientific article; zbMATH DE number 5279456 |
Statements
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (English)
0 references
27 May 2008
0 references
0 references
0 references
0 references
