On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs (Q2087455)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7604600
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs |
scientific article; zbMATH DE number 7604600 |
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
0.8622152805328369
0 references
0.8572285771369934
0 references
0.8054100275039673
0 references
0.7990179657936096
0 references
0.7898371815681458
0 references
