The complexity of the matching-cut problem for planar graphs and other graph classes (Q3652545)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the matching-cut problem for planar graphs and other graph classes |
scientific article |
Statements
The complexity of the matching-cut problem for planar graphs and other graph classes (English)
0 references
18 December 2009
0 references
matching-cut
0 references
edge cut
0 references
decomposable graph recognition problem
0 references
planar graph
0 references
computational complexity
0 references
