On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs (Q6396539): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:30, 10 July 2024
scientific article; zbMATH DE number 7604600
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs |
scientific article; zbMATH DE number 7604600 |
Statements
14 April 2022
0 references
math.CO
0 references
cs.CC
0 references
cs.DM
0 references
cs.DS
0 references
