Complexity of graph embeddability problems (Q1152224)

From MaRDI portal
Revision as of 02:23, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Complexity of graph embeddability problems
scientific article

    Statements

    title
    Complexity of graph embeddability problems (English)
    0 references
    author
    S. H. Smith
    0 references
    publication date
    1981
    0 references
    zbMATH Keywords
    time complexity
    0 references
    combinatorial embeddability in infinite graphs
    0 references
    planar graph
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    05C10
    0 references
    zbMATH DE Number
    3720365
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1152224&oldid=26031711"
    Powered by MediaWiki