New lower bound on the number of perfect matchings in fullerene graphs (Q1600673)

From MaRDI portal
Revision as of 05:02, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
New lower bound on the number of perfect matchings in fullerene graphs
scientific article

    Statements

    title
    New lower bound on the number of perfect matchings in fullerene graphs (English)
    0 references
    author
    Heping Zhang
    0 references
    Fu Ji Zhang
    0 references
    publication date
    16 June 2002
    0 references
    zbMATH DE Number
    1756351
    0 references
    zbMATH Keywords
    fullerene
    0 references
    Kekule structure
    0 references
    perfect matching
    0 references
    bicritical graph
    0 references
    2-extendable graph
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1600673&oldid=26367027"
    Powered by MediaWiki