On the Complexity of Planar Covering of Small Graphs (Q3104767): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1108.0064 / rank | |||
Normal rank |
Revision as of 15:07, 19 April 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