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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 04:44, 31 January 2024

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
    pseudograph
    0 references
    perfect matching
    0 references

    Identifiers