On the Complexity of Planar Covering of Small Graphs (Q3104767)

From MaRDI portal
Revision as of 18:03, 30 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    \(\operatorname{PlanarCover}(H)\) problem
    0 references