Checking the admissibility of odd-vertex pairings is hard (Q2142685)

From MaRDI portal
Revision as of 03:45, 29 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Checking the admissibility of odd-vertex pairings is hard
scientific article

    Statements

    title
    Checking the admissibility of odd-vertex pairings is hard (English)
    0 references
    author
    Florian Hoersch
    0 references
    publication date
    27 May 2022
    0 references
    zbMATH DE Number
    7533120
    0 references
    zbMATH Keywords
    orientation
    0 references
    connectivity
    0 references
    OpenAlex ID
    W3133747404
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2142685&oldid=36809758"
    Powered by MediaWiki