Complexity of discrete Seifert foliations over a graph (Q2332088)

From MaRDI portal
Revision as of 10:32, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of discrete Seifert foliations over a graph
scientific article

    Statements

    title
    Complexity of discrete Seifert foliations over a graph (English)
    0 references
    author
    Young Soo Kwon
    0 references
    Alexander Mednykh
    0 references
    Ilya A. Mednykh
    0 references
    publication date
    1 November 2019
    0 references
    Mathematics Subject Classification ID
    05C40
    0 references
    05C50
    0 references
    53C12
    0 references
    zbMATH DE Number
    7125252
    0 references
    zbMATH Keywords
    discrete Seifert foliations
    0 references
    generalized Petersen graphs
    0 references
    OpenAlex ID
    W2955182234
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2332088&oldid=37098117"
    Powered by MediaWiki