Knocking out \(P_k\)-free graphs (Q2352787): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:43, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Knocking out \(P_k\)-free graphs |
scientific article |
Statements
Knocking out \(P_k\)-free graphs (English)
0 references
6 July 2015
0 references
parallel knock-out schemes
0 references
Hamilton cycle
0 references
cographs
0 references
split graphs
0 references
computational complexity
0 references
