Finding matching cuts in \(H\)-free graphs (Q6046951)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7746799
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0 references
0.92473865
0 references
0 references
0 references
0.9143978
0 references
0.9100783
0 references
0.90482324
0 references
0.9031707
0 references
0.9015957
0 references
0.9015957
0 references
