On the complexity of planar covering of small graphs (Q3104767)
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 5988769
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of planar covering of small graphs |
scientific article; zbMATH DE number 5988769 |
Statements
On the Complexity of Planar Covering of Small Graphs (English)
0 references
16 December 2011
0 references
\(\operatorname{PlanarCover}(H)\) problem
0 references
0 references
0.8291833400726318
0 references
0.8242274522781372
0 references
0.8082216382026672
0 references
0.7978902459144592
0 references
