Computing planarity in computable planar graphs (Q503647)

From MaRDI portal
Revision as of 19:39, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing planarity in computable planar graphs
scientific article

    Statements

    title
    Computing planarity in computable planar graphs (English)
    0 references
    author
    Oscar Levin
    0 references
    Taylor McMillan
    0 references
    publication date
    13 January 2017
    0 references
    zbMATH Keywords
    infinite graphs
    0 references
    planar graphs
    0 references
    computability theory
    0 references
    planar embeddings
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C10
    0 references
    05C63
    0 references
    03D45
    0 references
    zbMATH DE Number
    6674443
    0 references
    OpenAlex ID
    W2473481609
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q503647&oldid=38378035"
    Powered by MediaWiki