Obtaining a planar graph by vertex deletion (Q2429328)
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: Obtaining a planar graph by vertex deletion |
scientific article; zbMATH DE number 6028460
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Obtaining a planar graph by vertex deletion |
scientific article; zbMATH DE number 6028460 |
Statements
Obtaining a planar graph by vertex deletion (English)
0 references
26 April 2012
0 references
planar graph
0 references
apex graph
0 references
FPT algorithm
0 references
vertex deletion
0 references
0 references
0 references
0 references
0 references
0 references
0.8664663
0 references
0.86573577
0 references
0.8587745
0 references
0.85785985
0 references
