Computational complexity of existence problems for matchings in graphs. (Q2756482)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational complexity of existence problems for matchings in graphs. |
scientific article; zbMATH DE number 1673030
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of existence problems for matchings in graphs. |
scientific article; zbMATH DE number 1673030 |
Statements
12 November 2001
0 references
Computational complexity of existence problems for matchings in graphs. (English)
0 references
