The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (Q5387763): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_25 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1772739528 / rank | |||
Normal rank | |||
Revision as of 14:19, 19 March 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
