Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths (Q6496556)
From MaRDI portal
scientific article; zbMATH DE number 7842228
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths |
scientific article; zbMATH DE number 7842228 |
Statements
Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths (English)
0 references
3 May 2024
0 references
0 references
