Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges (Q482134)

From MaRDI portal
Revision as of 09:34, 22 June 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
Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges
scientific article

    Statements

    Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 December 2014
    0 references

    Identifiers