Switching to Hedgehog-Free Graphs Is NP-Complete (Q3010425)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Switching to Hedgehog-Free Graphs Is NP-Complete |
scientific article |
Statements
Switching to Hedgehog-Free Graphs Is NP-Complete (English)
0 references
1 July 2011
0 references
Seidel's switching
0 references
\(H\)-free graph
0 references
NP-completeness
0 references
