On the complexity of the approximation of nonplanarity parameters for cubic graphs (Q1827857)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the approximation of nonplanarity parameters for cubic graphs |
scientific article |
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
