A note on matching-cut in \(P_t\)-free graphs (Q2094374)
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: A note on matching-cut in \(P_t\)-free graphs |
scientific article; zbMATH DE number 7609045
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on matching-cut in \(P_t\)-free graphs |
scientific article; zbMATH DE number 7609045 |
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
0.9143978
0 references
0.9122577
0 references
0.8891139
0 references
0.8818966
0 references
0.8814343
0 references
0 references
0.87636477
0 references
0.8733328
0 references
