The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (Q5387763): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:56, 9 February 2024
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
