Skip to main navigation Skip to search Skip to main content

A sharp upper bound for the number of spanning trees of a graph

  • Université Paris-Saclay

Research output: Contribution to journal › Article › peer-review

56   Link opens in a new tab Scopus citations

Fingerprint

Dive into the research topics of 'A sharp upper bound for the number of spanning trees of a graph'. Together they form a unique fingerprint.
Sort by

Mathematics