Complexity of finding maximum locally irregular induced subgraphs (Q6544081)
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: Complexity of finding maximum locally irregular induced subgraphs |
scientific article; zbMATH DE number 7853696
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of finding maximum locally irregular induced subgraphs |
scientific article; zbMATH DE number 7853696 |
Statements
Complexity of finding maximum locally irregular induced subgraphs (English)
0 references
27 May 2024
0 references
locally irregular
0 references
largest induced subgraph
0 references
FPT
0 references
treewidth
0 references
W-hardness
0 references
approximability
0 references
