Independent sets in \((P_4+P_4\),triangle)-free graphs (Q2053685)
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: Independent sets in (P₄+P₄,triangle)-free graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Independent sets in \((P_4+P_4\),triangle)-free graphs |
scientific article |
Statements
Independent sets in \((P_4+P_4\),triangle)-free graphs (English)
0 references
30 November 2021
0 references
maximum independent set problem
0 references
polynomial algorithms
0 references
\(S_{i, j, k}\)-free graphs
0 references
triangle-free graphs
0 references
0 references
0 references
0 references
0 references
0 references
0.9226902
0 references
0.9174815
0 references
0.9145842
0 references
0.9145164
0 references
0.90963185
0 references
0.90875554
0 references
0.9052415
0 references
0.90462303
0 references
0.9045328
0 references
