An upper bound for the number of spanning trees of a graph (Q1234299): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q301808
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Geoffrey R. Grimmett / rank
 
Normal rank

Revision as of 17:30, 12 February 2024

scientific article
Language Label Description Also known as
English
An upper bound for the number of spanning trees of a graph
scientific article

    Statements

    An upper bound for the number of spanning trees of a graph (English)
    0 references
    1977
    0 references
    0 references