Fullerene graphs have exponentially many perfect matchings (Q839387)

From MaRDI portal
Revision as of 05:42, 6 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fullerene graphs have exponentially many perfect matchings
scientific article

    Statements

    Fullerene graphs have exponentially many perfect matchings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 September 2009
    0 references
    fullerene
    0 references
    fullerene graph
    0 references
    perfect matching
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references