Partitioning \(H\)-free graphs of bounded diameter (Q2166756)
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: Partitioning \(H\)-free graphs of bounded diameter |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning \(H\)-free graphs of bounded diameter |
scientific article |
Statements
Partitioning \(H\)-free graphs of bounded diameter (English)
0 references
25 August 2022
0 references
vertex partitioning problem
0 references
\(H\)-free
0 references
diameter
0 references
complexity dichotomy
0 references
0 references
0 references
