On the complexity of the approximation of nonplanarity parameters for cubic graphs (Q2741456)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1642862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the approximation of nonplanarity parameters for cubic graphs |
scientific article; zbMATH DE number 1642862 |
Statements
24 October 2001
0 references
nonplanar deletion
0 references
planar graph
0 references
1.0000002
0 references
0.9174192
0 references
0 references
0 references
0.9033749
0 references
0 references
0.8929577
0 references
0.88660634
0 references
0.8854855
0 references
On the complexity of the approximation of nonplanarity parameters for cubic graphs (English)
0 references
