On the complexity of the approximation of nonplanarity parameters for cubic graphs (Q1827857)
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: On the complexity of the approximation of nonplanarity parameters for cubic graphs |
scientific article; zbMATH DE number 2083786
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the approximation of nonplanarity parameters for cubic graphs |
scientific article; zbMATH DE number 2083786 |
Statements
On the complexity of the approximation of nonplanarity parameters for cubic graphs (English)
0 references
6 August 2004
0 references
Topological graph theory
0 references
Complexity classes
0 references
Computational difficulty of problems
0 references
Splitting number
0 references
Maximum planar subgraph
0 references
