On the Complexity of Planar Covering of Small Graphs (Q3104767): Difference between revisions
From MaRDI portal
Latest revision as of 18:39, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Complexity of Planar Covering of Small Graphs |
scientific article |
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