A note on matching-cut in \(P_t\)-free graphs (Q2094374)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on matching-cut in \(P_t\)-free graphs |
scientific article |
Statements
A note on matching-cut in \(P_t\)-free graphs (English)
0 references
28 October 2022
0 references
matching-cut
0 references
\(P_t\)-free graph
0 references
computational complexity
0 references
