An exact upper bound to the maximum number of perfect matchings in cubic pseudographs (Q1164639)

From MaRDI portal
Revision as of 15:50, 13 June 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
An exact upper bound to the maximum number of perfect matchings in cubic pseudographs
scientific article

    Statements

    An exact upper bound to the maximum number of perfect matchings in cubic pseudographs (English)
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    pseudograph
    0 references
    perfect matching
    0 references
    0 references
    0 references
    0 references