An upper bound for the number of spanning trees of a graph
From MaRDI portal
Publication:1234299
DOI10.1016/S0012-365X(76)80005-2zbMath0348.05106OpenAlexW1994224017MaRDI QIDQ1234299
Publication date: 1977
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(76)80005-2
Related Items (14)
A bound for the complexity of a simple graph ⋮ The dynamics of the forest graph operator ⋮ Upper bounds for the number of spanning trees of graphs ⋮ Unions of random trees and applications ⋮ Spanning trees: A survey ⋮ The number of spanning trees of a graph ⋮ The maximum number of spanning trees of a graph with given matching number ⋮ A sharp upper bound for the number of spanning trees of a graph ⋮ On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs ⋮ The number of spanning trees of a graph with given matching number ⋮ The number of spanning trees of a graph ⋮ Exact Potts model partition functions on wider arbitrary-length strips of the square lattice ⋮ The number of spanning forests of a graph ⋮ Tree and forest weights and their application to nonuniform random graphs
Cites Work
This page was built for publication: An upper bound for the number of spanning trees of a graph
