Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (Q1946734)

From MaRDI portal
Revision as of 06:49, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/jct/SharirSW13, #quickstatements; #temporary_batch_1731475607626)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
scientific article

    Statements

    title
    Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (English)
    0 references
    author
    Adam Sheffer
    0 references
    Micha Sharir
    0 references
    Ermo Welzl
    0 references
    publication date
    15 April 2013
    0 references
    zbMATH Keywords
    spanning cycle
    0 references
    perfect matching
    0 references
    Kasteleyn's theorem
    0 references
    triangulation
    0 references
    plane graph
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C10
    0 references
    05C70
    0 references
    05C38
    0 references
    zbMATH DE Number
    6154115
    0 references
    Wikidata QID
    Q54308610
    0 references
    OpenAlex ID
    W2569928643
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1946734&oldid=37898808"
    Powered by MediaWiki