Untangling planar graphs from a specified vertex position-Hard cases (Q534342)

From MaRDI portal
Revision as of 07:54, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Untangling planar graphs from a specified vertex position-Hard cases
scientific article

    Statements

    title
    Untangling planar graphs from a specified vertex position-Hard cases (English)
    0 references
    author
    Mihyun Kang
    0 references
    Oleg Pikhurko
    0 references
    O. V. Ravskyj
    0 references
    Mathias Schacht
    0 references
    Oleg Verbitsky
    0 references
    Mathias Schacht
    0 references
    publication date
    17 May 2011
    0 references
    zbMATH DE Number
    5895540
    0 references
    zbMATH Keywords
    combinatorial geometry
    0 references
    graph drawing
    0 references
    planar graphs
    0 references
    untangling problem
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q534342&oldid=12422988"
    Powered by MediaWiki