On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs (Q6396539)
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: On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs |
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
14 April 2022
0 references
math.CO
0 references
cs.CC
0 references
cs.DM
0 references
cs.DS
0 references
