Finding matching cuts in \(H\)-free graphs (Q6046951): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4379796487 / rank | |||
Normal rank | |||
Revision as of 10:43, 30 July 2024
scientific article; zbMATH DE number 7746799
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding matching cuts in \(H\)-free graphs |
scientific article; zbMATH DE number 7746799 |
Statements
Finding matching cuts in \(H\)-free graphs (English)
0 references
6 October 2023
0 references
matching cut
0 references
perfect matching
0 references
\(H\)-free graph
0 references
computational complexity
0 references
