Knocking out \(P_k\)-free graphs (Q2352787)
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: Knocking out \(P_k\)-free graphs |
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
