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

From MaRDI portal
Revision as of 18:39, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an 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

    title
    On the Complexity of Planar Covering of Small Graphs (English)
    0 references
    publication date
    16 December 2011
    0 references
    Mathematics Subject Classification ID
    05C70
    0 references
    05C10
    0 references
    68Q17
    0 references
    zbMATH DE Number
    5988769
    0 references
    zbMATH Keywords
    \(\operatorname{PlanarCover}(H)\) problem
    0 references
    Wikidata QID
    Q62048093
    0 references
    OpenAlex ID
    W1670213466
    0 references
    arXiv ID
    1108.0064
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3104767&oldid=35258473"
    Powered by MediaWiki