On making a distinguished vertex of minimum degree by vertex deletion (Q528861): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6718311 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph modification problem | |||
| Property / zbMATH Keywords: graph modification problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
parameterized complexity | |||
| Property / zbMATH Keywords: parameterized complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
treewidth | |||
| Property / zbMATH Keywords: treewidth / rank | |||
Normal rank | |||
Revision as of 07:19, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On making a distinguished vertex of minimum degree by vertex deletion |
scientific article |
Statements
On making a distinguished vertex of minimum degree by vertex deletion (English)
0 references
17 May 2017
0 references
graph modification problem
0 references
parameterized complexity
0 references
treewidth
0 references
