On Switching to <i>H</i>‐Free Graphs (Q5417832)
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 6297913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Switching to <i>H</i>‐Free Graphs |
scientific article; zbMATH DE number 6297913 |
Statements
On Switching to <i>H</i>‐Free Graphs (English)
0 references
22 May 2014
0 references
Seidel's switching
0 references
computational complexity
0 references
\(H\)-free graphs
0 references
0 references
0.9077749
0 references
0 references
0.8819786
0 references
0.8819786
0 references
0.87999594
0 references
0 references
0.8784524
0 references
