On the expected number of perfect matchings in cubic planar graphs (Q2075311)

From MaRDI portal
Revision as of 10:26, 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
On the expected number of perfect matchings in cubic planar graphs
scientific article

    Statements

    On the expected number of perfect matchings in cubic planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2022
    0 references
    asymptotic enumeration
    0 references
    planar graphs
    0 references
    regular graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references