The complexity of the perfect matching-cut problem (Q6667583)
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: The complexity of the perfect matching-cut problem |
scientific article; zbMATH DE number 7971599
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the perfect matching-cut problem |
scientific article; zbMATH DE number 7971599 |
Statements
The complexity of the perfect matching-cut problem (English)
0 references
20 January 2025
0 references
claw-free
0 references
edge-cut
0 references
matching
0 references
NP-complete
0 references
perfect matching
0 references
planar graph
0 references
polynomial
0 references
treewidth
0 references
