The graph genus problem is NP-complete (Q3031932)

From MaRDI portal
Revision as of 10:26, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The graph genus problem is NP-complete
scientific article

    Statements

    title
    The graph genus problem is NP-complete (English)
    0 references
    author
    Carsten Thomassen
    0 references
    publication date
    1989
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68R10
    0 references
    05C10
    0 references
    03D15
    0 references
    zbMATH DE Number
    4130023
    0 references
    zbMATH Keywords
    graph genus problem
    0 references
    NP-complete
    0 references
    Wikidata QID
    Q56094152
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3031932&oldid=27443773"
    Powered by MediaWiki