On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs (Q2087455)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs |
scientific article |
Statements
On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs (English)
0 references
21 October 2022
0 references
matching cut
0 references
radius
0 references
complexity dichotomy
0 references
\(H\)-free
0 references
0 references
