On Switching to <i>H</i>‐Free Graphs (Q5417832): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.21745 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2098890646 / rank | |||
Normal rank | |||
Revision as of 00:49, 20 March 2024
scientific article; zbMATH DE number 6297913
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
